CodeForces 214E Relay Race （DP+思维）

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=3e2+10;
const int maxm=5e5+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int dp[maxn][maxn][maxn];///注意到两人走的距离数是一样的，第一二维度分别是两人所在的行，第三维是两人目前所走的步数
int val[maxn][maxn],n;
void solve(int x,int y,int z,int v){
    int tp1=z-x+1,tp2=z-y+1,add;
    if(tp1<1||tp1>n) return ;
    if(tp2<1||tp2>n) return ;
    add=val[x][tp1];
    if(x!=y||tp1!=tp2) add+=val[y][tp2];
    dp[x][y][z]=max(dp[x][y][z],v+add);
}
int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    rep(i,0,maxn) rep(j,0,maxn) rep(k,0,maxn) dp[i][j][k]=INT32_MIN;
    cin>>n;
    rep(i,1,n+1) rep(j,1,n+1) cin>>val[i][j];
    dp[1][1][1]=val[1][1];
    rep(k,1,2*n-1) rep(i,1,n+1) rep(j,1,n+1){
        if(dp[i][j][k]==INT32_MIN) continue;
        ///cout<<i<<" "<<j<<" "<<k<<endl;
        solve(i,j,k+1,dp[i][j][k]);
        solve(i+1,j,k+1,dp[i][j][k]);
        solve(i,j+1,k+1,dp[i][j][k]);
        solve(i+1,j+1,k+1,dp[i][j][k]);
    }
    ///if(n==2) cout<<dp[2][2][3]<<endl;
    cout<<dp[n][n][2*n-1]<<"\n";
    return 0;
}