典型四维棋盘型dp
#include <stdio.h>
#include <stdlib.h>#include <math.h>
int n,a,b,c,m[1020][1020],dp[20][20][20][20],l,k,i,j;
int maxx(int x,int y){
if(x>y){return x;}
else{return y;}
}
int main()
{ scanf("%d",&n);
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
m[i][j]=0;
}
}
scanf("%d %d %d",&a,&b,&c);
while(a!=0&&b!=0&&c!=0){
m[a][b]=c;
scanf("%d %d %d",&a,&b,&c);
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
for(k=1;k<=n;k++){
for(l=1;l<=n;l++){
dp[i][j][k][l]=m[i][j]+m[k][l]+maxx(maxx(dp[i-1][j][k-1][l],dp[i-1][j][k][l-1]),maxx(dp[i][j-1][k-1][l],dp[i][j-1][k][l-1]));
if(i==k||j==l){dp[i][j][k][l]-=m[i][j];}
}
}
}
}
printf("%d",m[n][n]+maxx(dp[n-1][n][n][n-1],dp[n][n-1][n-1][n]));
return 0;
}