P1004 [NOIP2000 提高组] 方格取数(四维dp)

题目链接:[NOIP2000 提高组] 方格取数 - 洛谷

题目要求找出两条路线, 使得权值最大, 因此创建一个四维数组, 前两位存第一个人走的路径, 后两位存第二个人走的路径, 两个人同时走(类似于dfs), 注意一下两个人不能走相同的路径就好了

ac代码:

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <map>
#include <set>
using namespace std;
#define ll long long
#define endl "\n"
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define repr(i, a, b) for (ll i = (a); i < (b); i++)
#define rrep(i, a, b) for (ll i = (b); i >= (a); i--)
#define rrepr(i, a, b) for (ll i = (b); i > (a); i--)
#define min(a,b) (a)<(b)?(a):(b)
#define max(a,b) (a)>(b)?(a):(b)

ll cnt,n,m,t,ans,ant;
const int N=1e5+10;
ll arr[50][50];
string str;

inline ll read()
{
    char c = getchar();int x = 0,s = 1;
    while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}//是符号
    while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}//是数字
    return x*s;
}


void solve()
{
    ll f[20][20][20][20];
    rep(i,1,n)//a朝下走
        rep(j,1,n)//a朝右走
            rep(k,1,n)//b下
                rep(l,1,n)//b右
                {
                    f[i][j][k][l]=max(
                        max(f[i-1][j][k-1][l],f[i][j-1][k][l-1]),
                        max(f[i-1][j][k][l-1],f[i][j-1][k-1][l])
                    );
                    cnt=arr[i][j];
                    if(i!=k&&j!=l) cnt+=arr[k][l];
                    f[i][j][k][l]+=cnt;
                }
    cout<<f[n][n][n][n];
    return;
}

int main()
{
    n=read();
    ll x,y,z;
    while(cin>>x>>y>>z&&!(x==0&&y==0&&z==0))
        arr[x][y]=max(arr[x][y],z);
    
    solve();
    return 0;
}