Matrix
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2515 Accepted Submission(s): 1336
Every time yifenfei should to do is that choose a detour which frome the top left point to the bottom right point and than back to the top left point with the maximal values of sum integers that area of Matrix yifenfei choose. But from the top to the bottom can only choose right and down, from the bottom to the top can only choose left and up. And yifenfei can not pass the same area of the Matrix except the start and end.
Each case first line given the integer n (2<n<30)
Than n lines,each line include n positive integers.(<100)
2 10 3 5 10 3 10 3 3 2 5 3 6 7 10 5 1 2 3 4 5 2 3 4 5 6 3 4 5 6 7 4 5 6 7 8 5 6 7 8 9
28 4680
AC代码:
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int data[40][40],dp[80][40][40]; int Max(int a,int b,int c,int d) { return max(a,max(b,max(c,d))); } int main() { int n; while(~scanf("%d",&n)) { int i,j,k; for(i=0;i<n;i++) for(j=0;j<n;j++) scanf("%d",&data[i][j]); memset(dp,0,sizeof(dp)); for(k=1;k<2*n-2;k++) for(i=0;i<n;i++) for(j=0;j<n;j++) { if(i==j) continue; dp[k][i][j]=Max(dp[k-1][i][j],dp[k-1][i-1][j],dp[k-1][i][j-1],dp[k-1][i-1][j-1]); dp[k][i][j]+=data[i][k-i]+data[j][k-j]; } int ans=max(dp[k-1][n-1][n-2],dp[k-1][n-2][n-1])+data[0][0]+data[n-1][n-1]; printf("%d\n",ans); } return 0; }