原文链接:https://www.luogu.com.cn/problem/P1004
AC代码:
#include<iostream>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
int mapp[10][10];
int n,f[10][10][10][10];
void deal(){
int i,j,k,l;
f[0][0][0][0]=0;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
for(k=0;k<n;k++){
for(l=0;l<n;l++){
if(i-1>=0&&k-1>=0) f[i][j][k][l]=max(f[i][j][k][l],f[i-1][j][k-1][l]);
if(i-1>=0&&l-1>=0) f[i][j][k][l]=max(f[i][j][k][l],f[i-1][j][k][l-1]);
if(j-1>=0&&k-1>=0) f[i][j][k][l]=max(f[i][j][k][l],f[i][j-1][k-1][l]);
if(j-1>=0&&l-1>=0) f[i][j][k][l]=max(f[i][j][k][l],f[i][j-1][k][l-1]);
if(i!=k&&l!=j){
f[i][j][k][l]+=mapp[i][j]+mapp[k][l];
}
else{
f[i][j][k][l]+=mapp[i][j];
}
}
}
}
}
}
int main(){
int i,j,p,q,r;
cin>>n;
memset(mapp,0,sizeof(mapp));
memset(f,0,sizeof(f));
while(cin>>p>>q>>r){
if(p==0&&q==0&&r==0){
break;
}
p--;q--;
mapp[p][q]=r;
}
deal();
cout<<f[n-1][n-1][n-1][n-1]<<endl;
return 0;
}