C11CUT - Cắt bảng

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);

int f[10][10][10][10];
int m, n, a[10][10];

int row(int i, int l, int r) {
    int res = 0;
    FOR(j,l,r)
        res = res * 10 + a[i][j];
    return res;
}

int col(int j, int l, int r) {
    int res = 0;
    FOR(i,l,r)
        res = res * 10 + a[i][j];
    return res;
}

int get(int u, int v, int x, int y) {
    if (f[u][v][x][y] >= 0) return f[u][v][x][y];
    if (u == x && v == y) return a[u][v];

    int res = 0;
    if (u < x) {
        res = max(res, row(u, v, y) + get(u+1, v, x, y));
        res = max(res, row(x, v, y) + get(u, v, x-1, y));
    }
    else res = max(res, row(u, v, y));

    if (v < y) {
        res = max(res, col(v, u, x) + get(u, v+1, x, y));
        res = max(res, col(y, u, x) + get(u, v, x, y-1));
    }
    else res = max(res, col(v, u, x));

    return f[u][v][x][y] = res;
}

int main() {
    scanf("%d%d", &m, &n);
    FOR(i,1,m) FOR(j,1,n) scanf("%d", &a[i][j]);

    memset(f, -1, sizeof f);
    cout << get(1, 1, m, n) << endl;
    return 0;
}

Download