洛谷P1006 传纸条

双线程dp，一来一回可以看作两个人从同一个起点走到同一个终点

#include <iostream>
#include <algorithm>
#define f(_x,_y) for(_x=1;_x<=_y;_x++)
using namespace std;
int map[55][55]={0},dp[55][55][55][55]={0},m,n;
int main(void){
    int i,j,x1,y1,x2,y2;cin>>m>>n;
    f(i,m)f(j,n)cin>>map[i][j];
    f(x1,m)f(y1,n)f(x2,m)f(y2,n){
        dp[x1][y1][x2][y2]=max(max(dp[x1-1][y1][x2-1][y2],dp[x1-1][y1][x2][y2-1]),max(dp[x1][y1-1][x2-1][y2],dp[x1][y1-1][x2][y2-1]))+map[x1][y1];
        if(x1-x2||y1-y2)dp[x1][y1][x2][y2]+=map[x2][y2];
    }
    cout<<dp[m][n][m][n];
}