zoukankan      html  css  js  c++  java
  • HDU 3401 Trade

    Trade

    Time Limit: 1000ms
    Memory Limit: 32768KB
    This problem will be judged on HDU. Original ID: 3401
    64-bit integer IO format: %I64d      Java class name: Main
     
    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

    Source

     
    解题:单调队列优化dp
     考虑买入
    $dp[i][j] = max(dp[i-1][j],dp[i - w - 1][k] + (k - j) imes ap$
    如何选择k,发现要维护$dp[i-w-1][k] - (m - k) imes ap$
     
    可以根据$dp[i-w-1][k] - (m-k) imes ap + (m - j) imes ap$ 计算出 $dp[i - w - 1][k] + (k - j) imes ap\,k < j$
     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 const int maxn = 2010;
     4 const int INF = 0x3f3f3f3f;
     5 int dp[maxn][maxn],q[maxn],p[maxn],hd,tl;
     6 
     7 int main(){
     8     int kase,ap,bp,as,bs,n,m,w;
     9     scanf("%d",&kase);
    10     while(kase--){
    11         scanf("%d%d%d",&n,&m,&w);
    12         for(int i = 1; i <= w + 1; ++i){
    13             scanf("%d%d%d%d",&ap,&bp,&as,&bs);
    14             for(int j = 0; j <= m; ++j){
    15                 dp[i][j] = j <= as?-ap*j:-INF;
    16                 if(i > 1) dp[i][j] = max(dp[i][j],dp[i-1][j]);
    17             }
    18         }
    19         for(int i = w + 2; i <= n; ++i){
    20             scanf("%d%d%d%d",&ap,&bp,&as,&bs);
    21             int k = i - w - 1;
    22             hd = tl = 0;
    23             for(int j = 0; j <= m; ++j){
    24                 int tmp = dp[k][j] - ap*(m - j);
    25                 while(hd < tl && p[tl-1] < tmp) --tl;
    26                 q[tl] = j;
    27                 p[tl++] = tmp;
    28                 while(hd < tl && j - q[hd] > as) ++hd;
    29                 dp[i][j] = max(dp[i-1][j],p[hd] + ap*(m - j));
    30             }
    31             hd = tl = 0;
    32             for(int j = m; j >= 0; --j){
    33                 int tmp = dp[k][j] + bp*j;
    34                 while(hd < tl && p[tl-1] < tmp) --tl;
    35                 q[tl] = j;
    36                 p[tl++] = tmp;
    37                 while(q[hd] - j > bs) ++hd;
    38                 dp[i][j] = max(dp[i][j],p[hd] - bp*j);
    39             }
    40         }
    41         printf("%d
    ",dp[n][0]);
    42     }
    43     return 0;
    44 }
    View Code
  • 相关阅读:
    js点击左右滚动+默认自动滚动类
    左右箭头+按钮+左右滑动幻灯
    超酷视频播放器详细地址
    经典123幻灯切换
    js左右滚动幻灯
    js数组操作
    js删除数据的几种方法
    【转】MySQL的各种timeout
    Mysql 分段统计
    【转】linux yum命令详解
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4802621.html
Copyright © 2011-2022 走看看