hdu4374　One hundred layer_n掳of parts in one layer-CSDN博客

本文链接：https://blog.csdn.net/mengzhengnan/article/details/9325585

Description

Now there is a game called the new man down 100th floor. The rules of this game is:
　　 1.  At first you are at the 1st floor. And the floor moves up. Of course you can choose which part you will stay in the first time.
　　 2.  Every floor is divided into M parts. You can only walk in a direction (left or right). And you can jump to the next floor in any part, however if you are now in part “y”, you can only jump to part “y” in the next floor! (1<=y<=M)
　　 3.  There are jags on the ceils, so you can only move at most T parts each floor.
　　 4.  Each part has a score. And the score is the sum of the parts’ score sum you passed by.
Now we want to know after you get the 100th floor, what’s the highest score you can get.

Input

The first line of each case has four integer N, M, X, T(1<=N<=100, 1<=M<=10000, 1<=X， T<=M). N indicates the number of layers; M indicates the number of parts. At first you are in the X-th part. You can move at most T parts in every floor in only one direction.
Followed N lines, each line has M integers indicating the score. (-500<=score<=500)

Output

Output the highest score you can get.

Sample Input

Sample Output

       
       
        
        29
       
       
       
       
        
        状态转移方程f[i][j]表示第i层，第j部分可以得到的分数，很明显，f[i][j]=max{f[i-1][k]+[k到是j的和
        
        ]
       
       
       
       
        
        当然，这个数据在10005这么大,不可能全部都搜出来，这样，我们只能用单调队列，来进行优化，但有一个问题　
       
       
       
       
        
        sum[k-j]的值是和j有关的，我们应该明白，单调队列，是不能，存入与现在这个状态有关的变量，但这个现在的变题量，也只是在算到j的时候，才有意义，而且这个sum[j],我们完全可以在队列外直接加起来，这样，只能转化sum[k-j]=sum[j]-sum[k],这样f[i][j]=max(f[i-1][k]-sum[k]
       
       
       
       
        
        +sum[j],这样，就可以用优先队列，把sum[k]+f[i-1][k]存入优先队列，这样就可以大大简化算的过程！
       
       
       
       
        
        }
       
       
       
       
        
        #include<stdio.h>
#include<queue>

#include<iostream>
using namespace std;
int dp[105][10005],sum[10005],val[105][10005];
struct floor {int id,x;};

int n,m,x,t;
#define inf -10000000
int fmax(int a,int b)
{
    if(a>b)
    return a;
    return b;
}
int fabs(int a)
{
	if(a<0)
return -a;
return a;
}
void init()
{
    int i,j;
    for( i=0;i<n;i++)
        for(j=1;j<=m;j++)
        {
            scanf("%d",&val[i][j]);

        }
    for(i=0;i<=n;i++)
        for(j=0;j<=m;j++)
        {
            dp[i][j]=inf;

        }
        dp[0][x]=val[0][x];
       int  cnt=val[0][x];

        for(i=0,j=x-1;i<t&&j>0;i++,j--)//向左走
        {
            cnt+=val[0][j];
            dp[0][j]=cnt;
        }
		cnt=val[0][x];
        for( i=0,j=x+1;i<t&&j<=m;i++,j++)//向右走累加起来　
        {
            cnt+=val[0][j];
            dp[0][j]=cnt;
        }


}
int makedp()
{
    deque<floor> q;
    floor temp;
    int i,j;
    for( i=1;i<n;i++)
    {
        sum[0]=0;
		q.clear();
        for(j=1;j<=m;j++)
        {
            while(!q.empty()&&(q.front().id<j-t))//右边
            {
               q.pop_front();
            }
            sum[j]=val[i][j]+sum[j-1];
            temp.x=dp[i-1][j]-sum[j-1];
            while(!q.empty()&&q.back().x<=temp.x)
            {
                q.pop_back();
            }
            temp.id=j;
            q.push_back(temp);
            if(!q.empty())
            {
                dp[i][j]=q.front().x+sum[j];
            }
        }
	    q.clear();
        sum[m+1]=0;
        for(j=m;j>0;j--)
        {
            while(!q.empty()&&(q.front().id>j+t))//左边
            {
                q.pop_front();
            }
            sum[j]=val[i][j]+sum[j+1];
            temp.x=dp[i-1][j]-sum[j+1];
            while(!q.empty()&&q.back().x<=temp.x)
            {
                q.pop_back();
            }
			temp.id=j;
            q.push_back(temp);
            if(!q.empty())
            {
                dp[i][j]=fmax(dp[i][j],q.front().x+sum[j]);
            }

        }

    }

     return 1;
}
int main ()
{
    int maxx=inf,i;
    while(scanf("%d%d%d%d",&n,&m,&x,&t)!=EOF)
    {

        init();
        makedp();
        maxx=dp[n-1][0];
        for( i=2;i<=m;i++)
        {
           maxx=fmax(maxx,dp[n-1][i]);
		 // printf("%d ",dp[n-1][i]);
        }
        printf("%d\n",maxx);
    }

    return 0;
}