C11ROOKS - Hai quân xe

Tác giả: RR

Ngôn ngữ: C++

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

#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define FORN(i,a,b) for(int i=(a),_b=(b);i<_b;i++)
#define DOWN(i,a,b) for(int i=a,_b=(b);i>=_b;i--)
#define SET(a,v) memset(a,v,sizeof(a))
#define sqr(x) ((x)*(x))
#define ll long long
#define F first
#define S second
#define PB push_back
#define MP make_pair

#define DEBUG(x) cout << #x << " = "; cout << x << endl;
#define PR(a,n) cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl;
#define PR0(a,n) cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl;
using namespace std;

//Buffer reading
int INP,AM,REACHEOF;
#define BUFSIZE (1<<12)
char BUF[BUFSIZE+1], *inp=BUF;
#define GETCHAR(INP) { \
    if(!*inp) { \
        if (REACHEOF) return 0;\
        memset(BUF,0,sizeof BUF);\
        int inpzzz = fread(BUF,1,BUFSIZE,stdin);\
        if (inpzzz != BUFSIZE) REACHEOF = true;\
        inp=BUF; \
    } \
    INP=*inp++; \
}
#define DIG(a) (((a)>='0')&&((a)<='9'))
#define GN(j) { \
    AM=0;\
    GETCHAR(INP); while(!DIG(INP) && INP!='-') GETCHAR(INP);\
    if (INP=='-') {AM=1;GETCHAR(INP);} \
    j=INP-'0'; GETCHAR(INP); \
    while(DIG(INP)){j=10*j+(INP-'0');GETCHAR(INP);} \
    if (AM) j=-j;\
}
//End of buffer reading

const long double PI = acos((long double) -1.0);
const int MN = 333;

int n, a[MN][MN];
int row[MN], col[MN], best[2][MN][MN], save[2][MN][MN], cc[MN][MN], rr[MN][MN];

int main() {
    while (scanf("%d", &n) == 1) {
        memset(row, 0, sizeof row);
        memset(col, 0, sizeof col);

        FOR(i,1,n) FOR(j,1,n) {
            scanf("%d", &a[i][j]);
            row[i] += a[i][j];
            col[j] += a[i][j];
        }

        FOR(i,1,n) FOR(j,1,n) {
            cc[i][j] = col[i] + col[j];
            rr[i][j] = row[i] + row[j];
        }

        int res = 0;
        // Same row
        FOR(i,1,n) {
            FOR(j1,1,n) FOR(j2,j1+1,n) {
                res = max(res, cc[j1][j2] + row[i] - 2*(a[i][j1] + a[i][j2]));
            }
        }

        // Same column
        FOR(j,1,n) {
            FOR(i1,1,n) FOR(i2,i1+1,n) {
                res = max(res, rr[i1][i2] + col[j] - 2*(a[i1][j] + a[i2][j]));
            }
        }

        // Different row, different column
        int now;
        FOR(i1,1,n) FOR(i2,1,n) if (i1 != i2) {
            best[0][i1][i2] = best[1][i1][i2] - 1000111000;
            int t = rr[i1][i2];
            FOR(j,1,n) {
                now = col[j] - 2*a[i2][j] - a[i1][j] + t;
                if (now > best[0][i1][i2]) {
                    best[0][i1][i2] = now;
                    save[0][i1][i2] = j;
                }
                else if (now > best[1][i1][i2]) {
                    best[1][i1][i2] = now;
                    save[1][i1][i2] = j;
                }
            }
        }

        FOR(i1,1,n) FOR(i2,1,n) if (i1 != i2)
        FOR(j1,1,n) {
            if (j1 == save[0][i1][i2])
                 res = max(res, col[j1] - 2*a[i1][j1] - a[i2][j1] + best[1][i1][i2]);
            else res = max(res, col[j1] - 2*a[i1][j1] - a[i2][j1] + best[0][i1][i2]);
        }
        cout << res << endl;
    }
    return 0;
}

Download