蒜头君的城堡之旅（动态规划）

 1 #include <map>
 2 #include <set>
 3 #include <stack>
 4 #include <queue>
 5 #include <cmath>
 6 #include <ctime>
 7 #include <string>
 8 #include <limits>
 9 #include <cstdio>
10 #include <vector>
11 #include <iomanip>
12 #include <cstdlib>
13 #include <cstring>
14 #include <iostream>
15 #include <algorithm>
16 #define Scc(c) scanf("%c",&c)
17 #define Scs(s) scanf("%s",s)
18 #define Sci(x) scanf("%d",&x)
19 #define Sci2(x, y) scanf("%d%d",&x,&y)
20 #define Sci3(x, y, z) scanf("%d%d%d",&x,&y,&z)
21 #define Scl(x) scanf("%I64d",&x)
22 #define Scl2(x, y) scanf("%I64d%I64d",&x,&y)
23 #define Scl3(x, y, z) scanf("%I64d%I64d%I64d",&x,&y,&z)
24 #define Pri(x) printf("%d\n",x)
25 #define Prl(x) printf("%I64d\n",x)
26 #define Prc(c) printf("%c\n",c)
27 #define Prs(s) printf("%s\n",s)
28 #define For(i,x,y) for(int i=x;i<y;i++)
29 #define For_(i,x,y) for(int i=x;i<=y;i++)
30 #define FFor(i,x,y) for(int i=x;i>y;i--)
31 #define FFor_(i,x,y) for(int i=x;i>=y;i--)
32 #define Mem(f, x) memset(f,x,sizeof(f))
33 #define LL long long
34 #define ULL unsigned long long
35 #define MAXSIZE 55
36 #define INF 0x3f3f3f3f
37 
38 const int mod=1e9+7;
39 const double PI = acos(-1.0);
40 
41 using namespace std;
42 int dp[MAXSIZE][MAXSIZE][MAXSIZE][MAXSIZE];
43 int main()
44 {
45 
46     Mem(dp,0);
47     int mapp[MAXSIZE][MAXSIZE];
48     int n,m;
49     Sci2(n,m);
50     For_(i,1,n)
51     For_(j,1,m)
52     Sci(mapp[i][j]);
53     For_(i,1,n)
54     For_(j,1,m)
55     For_(k,1,n)
56     For_(l,1,m)
57     {
58         if(i+j==k+l&&i!=k&&j!=l)
59         {
60             dp[i][j][k][l]=max(   max(dp[i-1][j][k-1][l],dp[i][j-1][k][l-1] ),max(dp[i-1][j][k][l-1],dp[i][j-1][k-1][l]))+mapp[i][j]+mapp[k][l];//计算两条路之和，所以这里加上   mapp[i][j]、mapp[k][l]
61         }
62     }
63     Pri(dp[n][m-1][n-1][m]);
64     return 0;
65 }