C11ROOKS - Hai quân xe

Tác giả: hieult

Ngôn ngữ: C++

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>

#include <ctime>
#include <deque>
#include <bitset>
#include <cctype>
#include <utility>
#include <cassert>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

#define Rep(i,n) for(int i = 0; i < (n); ++i)
#define Repd(i,n) for(int i = (n)-1; i >= 0; --i)
#define For(i,a,b) for(int i = (a); i <= (b); ++i)
#define Ford(i,a,b) for(int i = (a); i >= (b); --i)
#define Fit(i,v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define Fitd(i,v) for(__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))

template<class F, class T> T convert(F a, int p = -1) {
  stringstream ss;
  if (p >= 0)
    ss << fixed << setprecision(p);
  ss << a;
  T r;
  ss >> r;
  return r;
}
template<class T> T gcd(T a, T b) {
  T r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
template<class T> T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template<class T> T sqr(T x) {
  return x * x;
}
template<class T> T cube(T x) {
  return x * x * x;
}
template<class T> int getbit(T s, int i) {
  return (s >> i) & 1;
}
template<class T> T onbit(T s, int i) {
  return s | (T(1) << i);
}
template<class T> T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template<class T> int cntbit(T s) {
  return s == 0 ? 0 : cntbit(s >> 1) + (s & 1);
}

typedef pair<int, int> II;

const double PI = acos(-1.0);
const double eps = 1e-3;

const int dr[] = { -1, 0, +1, 0 };
const int dc[] = { 0, +1, 0, -1 };

const int inf = (int) 1e9 + 5;
const ll linf = (ll) 1e16 + 5;
const ll mod = (ll) 1e9 + 7;

#define maxn 305

int n, a[maxn][maxn], sumr[maxn], sumc[maxn], A[maxn], B[maxn];

int cal(int c[],int d[]){
	int vt = -1, MAX = -1, res = 0;
	For(i, 1, n) if(c[i] > MAX){
		MAX = c[i];
		vt = i;
	}

	res = MAX;
	MAX = -1;
	For(i, 1, n) if(d[i] > MAX && i != vt){
		MAX = d[i];
	}
	res += MAX;
	return res;
}

int main() {
//	freopen("in.txt", "r", stdin);

	ms(sumr, 0); ms(sumc, 0);

	cin >> n;
	For(i, 1, n) For(j, 1, n){
		scanf("%d", &a[i][j]);
		sumr[i] += a[i][j];
		sumc[j] += a[i][j];
	}

	int res = 0;
	For(i, 1, n) For(j, i + 1, n){
		int ret = 0;
		ret += sumr[i] + sumr[j];
		for(int k = 1; k <= n; k++){
			A[k] = sumc[k] - a[i][k] - 2 * a[j][k];
			B[k] = sumc[k] - 2 * a[i][k] - a[j][k];
		}

		ret += max(cal(A, B), cal(B, A));
		res = max(res, ret);
	}

	For(i, 1, n){
		int ret = sumr[i];
		for(int k = 1; k <= n; k++){
			A[k] = sumc[k] - 2 * a[i][k];
		}
		ret += cal(A, A);
		res = max(res, ret);
	}

	For(i, 1, n){
		int ret = sumc[i];
		for(int k = 1; k <= n; k++){
			A[k] = sumr[k] - 2 * a[k][i];
		}
		ret += cal(A, A);
		res = max(res, ret);
	}

	cout << res;
//	cout << clock() << endl;
	return 0;
}

Download