tests/upload/test2_2.sy


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

int dp[55][55][55][55];
int a[55][55];

int mmax(int a, int b) {
	if (a>b) {
		return a;
	}
	else {
		return b;
	}
}

int main()
{
    int m;
	int n;
	int i;
	int j;
	int k;
	int l;
	    
    m=getint();
    n=getint();
    
    i=1;
    while (i<=m) {
		j=1;
        while (j<=n) {
            a[i][j]=getint();
            j=j+1;
        }
        i=i+1;
    }
    
    i=1;
    while(i<=m){
    	j=1;
        while(j<=n){
        	k=1;
            while(k<=m){
            	l=1;
                while(l<=n){
                    dp[i][j][k][l]=
					mmax(mmax(dp[i-1][j][k-1][l],dp[i-1][j][k][l-1]),                          
						mmax(dp[i][j-1][k][l-1],dp[i][j-1][k-1][l]))+a[i][j]+a[k][l];
                    if (i==k && j==l) { 
                        dp[i][j][k][l] = dp[i][j][k][l] - a[k][l];
                    }
                    l=l+1;
                }
                k=k+1;
            }
            j=j+1;
        }
        i=i+1;
    }
    putint(dp[m][n][m][n]);
    return 0;
}