[错题记录][vijos1280]The Moment-遇见

链接←

70分，改天再调
因为是给pascal的题目，在c++这里负数的数组下标就很难处理

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int MAXN = 3000 + 5;
int map[MAXN][MAXN];
int n,p = 1061109567;
bool dp[61][31][3000];
int minx = 1061109567;
int main(){
    scanf("%d",&n);
    for(int i = 1;i <= n;i ++){
        for(int j = 1;j <= i;j ++){
            scanf("%d",&map[i][j]);
            p = min(p,map[i][j]);
        }
    }
    for(int i = n + 1;i <= (n << 1) - 1;i ++){
        for(int j = 1;j <= (n << 1) - i;j ++){
            scanf("%d",&map[i][j]);
            p = min(p,map[i][j]);
        }
    }
    if(p > 0)p = -p;
    p *= 3;
    dp[(n << 1) - 1][1][map[(n << 1) - 1][1] - p] = true;
    dp[(n << 1) - 1][1][-map[(n << 1) - 1][1] - p] = true;
    for(int i = (n << 1) - 1;i >= n;i --){
        for(int k = 0;k < MAXN;k ++){
            if(k - map[i][1] >= 0 && k - map[i][1] < MAXN)dp[i][1][k] |= dp[i + 1][1][k - map[i][1]]
                |dp[i + 1][2][k - map[i][1]];
            if(k + map[i][1] >= 0 && k + map[i][1] < MAXN)dp[i][1][k] |= dp[i + 1][1][k + map[i][1]]
                |dp[i + 1][2][k + map[i][1]];
        }
        for(int j = 2;j <= (n << 1) - i - 1;j ++){
            for(int k = 0;k < MAXN;k ++){
                if(k - map[i][j] >= 0 && k - map[i][j] < MAXN)dp[i][j][k] |= dp[i + 1][j][k - map[i][j]]
                    |dp[i + 1][j + 1][k - map[i][j]]|dp[i + 1][j - 1][k - map[i][j]];
                if(k + map[i][j] >= 0 && k + map[i][j] < MAXN)dp[i][j][k] |= dp[i + 1][j][k + map[i][j]]
                    |dp[i + 1][j + 1][k + map[i][j]]|dp[i + 1][j - 1][k + map[i][j]];
            }
        }
        for(int k = 0;k <= MAXN;k ++){
            if(k - map[i][(n << 1) - i] >= 0 && k - map[i][(n << 1) - i] < MAXN)dp[i][(n << 1) - i][k] |= dp[i + 1][(n << 1) - i - 1][k - map[i][(n << 1) - i]];
            if(k + map[i][(n << 1) - i] >= 0 && k + map[i][(n << 1) - i] < MAXN)dp[i][(n << 1) - i][k] |= dp[i + 1][(n << 1) - i - 1][k + map[i][(n << 1) - i]];
        }
    }
    for(int i = n - 1;i >= 1;i --){
        for(int k = 0;k < MAXN;k ++){
            if(k - map[i][1] >= 0 && k - map[i][1] < MAXN)dp[i][1][k] |= dp[i + 1][1][k - map[i][1]]
                |dp[i + 1][2][k - map[i][1]];
            if(k + map[i][1] >= 0 && k + map[i][1] < MAXN)dp[i][1][k] |= dp[i + 1][1][k + map[i][1]]
                |dp[i + 1][2][k + map[i][1]];
        }
        for(int j = 2;j <= i - 1;j ++){
            for(int k = 0;k < MAXN;k ++){
                if(k - map[i][j] >= 0 && k - map[i][j] < MAXN)dp[i][j][k] |= dp[i + 1][j][k - map[i][j]]
                    |dp[i + 1][j + 1][k - map[i][j]]|dp[i + 1][j - 1][k - map[i][j]];
                if(k + map[i][j] >= 0 && k - map[i][j] < MAXN)dp[i][j][k] |= dp[i + 1][j][k + map[i][j]]
                    |dp[i + 1][j + 1][k + map[i][j]]|dp[i + 1][j - 1][k + map[i][j]];
            }
        }
        for(int k = 0;k < MAXN;k ++){
            if(k - map[i][i] >= 0 && k - map[i][i] < MAXN)dp[i][i][k] |= dp[i + 1][i + 1][k - map[i][i]];
            if(k + map[i][i] >= 0 && k + map[i][i] < MAXN)dp[i][i][k] |= dp[i + 1][i + 1][k + map[i][i]];
        }
    }
    p = -p;
    for(int i = 0;i < MAXN;i ++){
        if(dp[1][1][i])minx = min(minx,abs(p - i));
    }
    printf("%d",minx);
    //for(int i = 0;i < MAXN;i ++)if(dp[3][1][i])printf("%d ",i);
    return 0;
}