72pts玄关求条

1234567891011121314151617181920212223242526272829303132#include <bits/stdc++.h>
#define r(a,b,c) for(int a=b;a<=c;a++)
#define R(a,b,c) for(int a=b;a>=c;a--)
using namespace std;
int n,a[10][10],dp[10][10][10][10]; 
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin>>n;
	int u,v,w;
	while(cin>>u>>v>>w){
		if(u==0&&v==0&&w==0) break;
		a[u][v]=w;
	}
	r(i,1,n){
		r(j,1,n){
			r(k,1,n){
				int l=i+j-k;
				dp[i][j][k][l]=max({dp[i][j-1][k][l-1],dp[i][j-1][k-1][l], \
				                    dp[i-1][j][k][l-1],dp[i-1][j][k][l-1]})\
								+a[i][j]+a[k][l];
				if(i==k&&j==l) dp[i][j][k][l]-=a[i][j];
			}
		}
	}
	cout<<dp[n][n][n][n];
	return 0;
}