P1004 方格取数

https://www.luogu.org/problem/P1004 

思路：dp[i][j][k][z]表示第一个在（i，j），第二个在（k，z）； 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

ll a[11][11];
ll dp[11][11][11][11];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int n;
    cin>>n;
    while(1)
    {
        int x,y,z;
        cin>>x>>y>>z;
        a[x][y]=z;
        if(!x&&!y&&!z) break;
    }

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            for(int k=1;k<=n;k++)
            {
                for(int z=1;z<=n;z++)
                {
                    dp[i][j][k][z]=max(  max(dp[i-1][j][k-1][z],dp[i-1][j][k][z-1]),  max(dp[i][j-1][k][z-1],dp[i][j-1][k-1][z])  )+a[i][j]+a[k][z];
                    if(i==k&&j==z) dp[i][j][k][z]-=a[i][j];
                }
            }
        }
    }

    cout<<dp[n][n][n][n]<<endl;



    return 0;
}