【NOIP2017提高A组模拟10.5】Snake vs Block

Description

Input

Output

一个整数：最佳分数

Sample Input

5
-2 0 0 1 -2
0 2 0 0 0
-4 -3 -2 -3 -7
1 0 0 0 0
0 -2 0 -2 0
0

Sample Output

8

Solution

题意有点不清
它意思是只能往前，不能后退，在同一行中可以左右来回走

考虑DP
设f[i][k][j]表示到了第i行，从第j列到下一行，长度为k的最大答案
g[k][l][r]表示目前这一行剩下的长度为k，从l列到r列的最大答案
区间DP，转移即可

Code

#include<cstdio>
#include<algorithm>
#include<cstring>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define P(x,y) (((x)-1)*5+(y))
using namespace std;
int a[210][6],b[210][6],n,m,f[210][5001][6],g[5001][6][6],ans=0,mx[210];
int main()
{
    freopen("snakevsblock.in","r",stdin);
    freopen("snakevsblock.out","w",stdout);
    scanf("%d",&n);mx[0]=4;
    fo(i,1,n)
    {
        mx[i]=mx[i-1];
        fo(j,1,5) scanf("%d",&a[i][j]),mx[i]+=max(a[i][j],0);
        mx[i]=min(mx[i],5000);
    }
    scanf("%d",&m);
    fo(i,1,m)
    {
        int x,y;scanf("%d%d",&x,&y);
        b[x][y]=1;
    }
    memset(f,200,sizeof(f));
    f[0][4][3]=0;
    fo(i,1,n)
    {
        memset(g,200,sizeof(g));
        fo(j,1,5) fo(k,0,mx[i]) if(k-a[i][j]>=0)g[k][j][j]=f[i-1][k-a[i][j]][j]+max(-a[i][j],0);
        fo(j,2,5) fo(l,1,5-j+1) fo(k,0,mx[i])
        {
            int r=l+j-1,bz=0;
            fo(q,l,r-1) if(b[i][q]) bz=1;
            if(bz) continue;
            if(k-a[i][l]>=0) g[k][l][r]=max(g[k][l][r],g[k-a[i][l]][l+1][r]+max(-a[i][l],0));
            if(k-a[i][r]>=0) g[k][l][r]=max(g[k][l][r],g[k-a[i][r]][l][r-1]+max(-a[i][r],0));
        }
        fo(k,0,mx[i]) fo(j,1,5) fo(l,1,j) fo(r,l,5) 
        {
            if(b[i][r-1]&&r>l) break;
            if(r>=j) ans=max(ans,f[i][k][j]=max(f[i][k][j],g[k][l][r]));
            if(k==6)
            {
                printf("");
                printf("");
            }
        }
    }
    printf("%d",ans);
}