hdu 3401 單調佇列+DP

life4711發表於2014-11-12
原文網址 : https://blog.csdn.net/lvshubao1314/article/details/41051073
佇列

http://acm.hdu.edu.cn/showproblem.php?pid=3401



Problem Description
Recently, lxhgww is addicted to stock, he finds some regular patterns after a few days' study.
He forecasts the next T days' stock market. On the i'th day, you can buy one stock with the price APi or sell one stock to get BPi. 
There are some other limits, one can buy at most ASi stocks on the i'th day and at most sell BSi stocks.
Two trading days should have a interval of more than W days. That is to say, suppose you traded (any buy or sell stocks is regarded as a trade)on the i'th day, the next trading day must be on the (i+W+1)th day or later.
What's more, one can own no more than MaxP stocks at any time.

Before the first day, lxhgww already has infinitely money but no stocks, of course he wants to earn as much money as possible from the stock market. So the question comes, how much at most can he earn?
 

Input
The first line is an integer t, the case number.
The first line of each case are three integers T , MaxP , W .
(0 <= W < T <= 2000, 1 <= MaxP <= 2000) .
The next T lines each has four integers APi，BPi，ASi，BSi( 1<=BPi<=APi<=1000,1<=ASi,BSi<=MaxP), which are mentioned above.
 

Output
The most money lxhgww can earn.
 

Sample Input
1
5 2 0
2 1 1 1
2 1 1 1
3 2 1 1
4 3 1 1
5 4 1 1





 



Sample Output




3






/**
hdu 3401 單調佇列+DP
http://blog.csdn.net/acm_ted/article/details/7909742
*/
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define MAX 2005
#define inf 0xfffff
int T,MaxP,w;
int APi[MAX],BPi[MAX],ASi[MAX],BSi[MAX];
int dp[MAX][MAX];
struct node
{
    int x;
    int p;
}q[2005],temp;
int front,back;
int main()
{
    int cas;
    scanf("%d",&cas);
    while(cas--)
    {
        scanf("%d%d%d",&T,&MaxP,&w);
        for(int i=1;i<=T;++i)
            scanf("%d%d%d%d",APi+i,BPi+i,ASi+i,BSi+i);
        for(int i=0;i<=T;i++)
            for(int j=0;j<=MaxP;++j)
                dp[i][j]=-inf;
        for(int i=1;i<=w+1;i++)
            for(int j=0;j<=ASi[i];++j)
                 dp[i][j]=(-APi[i]*j);
        for(int i=2;i<=T;i++)
        {
            for(int j=0;j<=MaxP;j++)
                dp[i][j]=max(dp[i][j],dp[i-1][j]);
            if(i<=w+1) continue;
            //買入
            front=back=1;
            for(int j=0;j<=MaxP;j++)
            {
                temp.p=j;
                temp.x=dp[i-w-1][j]+APi[i]*j;
                while(front<back&&q[back-1].x<temp.x)
                      back--;
                q[back++]=temp;
                while(front<back&&q[front].p+ASi[i]<j)
                     front++;
                dp[i][j]=max(dp[i][j],q[front].x-APi[i]*j);
            }
            front=back=1;
            for(int j=MaxP;j>=0;j--)
            {
                temp.p=j;
                temp.x=dp[i-w-1][j]+BPi[i]*j;
                while(front<back&&q[back-1].x<temp.x)
                    back--;
                q[back++]=temp;
                while(front<back&&q[front].p-BSi[i]>j)
                      front++;
                dp[i][j]=max(dp[i][j],q[front].x-BPi[i]*j);
            }
        }
        int ans=0;
        for(int i=0;i<=MaxP;i++)
            ans=max(ans,dp[T][i]);
        printf("%d\n",ans);
    }
    return 0;
}


















            




相關文章