HDU 3401 Trade

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define maxn 2005
#define inf (1<<20)


int dp[maxn][maxn];
int ap[maxn],bp[maxn],as[maxn],bs[maxn];
int Q[maxn];
int head,tail;


int main()
{
    int kase;
    scanf("%d",&kase);
    while(kase--)
    {
        int t,maxp,w;
        int i,j;
        scanf("%d%d%d",&t,&maxp,&w);
        for(i=1;i<=t;i++)
        {
            scanf("%d%d%d%d",&ap[i],&bp[i],&as[i],&bs[i]);
        }
        for(i=0;i<=t;i++)  for(j=0;j<=maxp;j++)  dp[i][j]=-inf;
        dp[0][0]=0;
        for(i=1;i<=w+1;i++)
        {
            dp[i][0]=0;
            for(j=1;j<=min(as[i],maxp);j++)
            {
                dp[i][j]=-j*ap[i];
            }
        }
        for(i=1;i<=t;i++)
        {
            for(j=0;j<=maxp;j++)
            {
                dp[i][j]=max(dp[i][j],dp[i-1][j]);
            }
            if(i<=w+1)  continue;
            int pre=i-w-1;
            head=tail=0;
            for (j = 0; j <= maxp; ++j)
            {
                while (tail > head && Q[head] + as[i] < j) head++;
                int tmp = dp[i - w - 1][j];
                while (tail > head && dp[pre][Q[tail-1]] - ap[i]*(j - Q[tail-1]) < tmp) tail--;
                Q[tail++] = j;
                dp[i][j] = max(dp[i][j],dp[pre][Q[head]] - ap[i]*(j - Q[head]));
            }
            
            head=tail=0;
            for (j = maxp; j >= 0; --j)
            {
                while (tail > head && Q[head] - bs[i] > j) head++;
                int tmp = dp[i - w - 1][j];
                while (tail > head && dp[pre][Q[tail-1]] + bp[i]*(Q[tail-1] - j) < tmp) tail--;
                Q[tail++] = j;
                dp[i][j] = max(dp[i][j],dp[pre][Q[head]] + bp[i]*(Q[head] - j));
            }
        }
        int ans=0;
        for(i=0;i<=maxp;i++)  ans=max(ans,dp[t][i]);
        printf("%d\n",ans);
    }
    return 0;
}