題目連結

  這道題還稍微有了點坑點，就是一開始過了的時候沒想到的，就是在一開始處理的時候，我們用到單調佇列，但是單調佇列一開始，我用陣列模擬，所以先放進去了區間長度-1個元素，但是，這個時候，就會有問題，就是，如果期限剛好在區間內的話，我們就會少去這個答案，所以不行！我們一邊插入的同時，還需要一邊考慮，這樣才能達到完整的解。

對了，附上一隻小貓咪——挺可愛的說：

/*
 *                             UM.
 *                            [email protected]@1                                                                    
 
[email protected]
 *                           [email protected]@@[email protected]                                                              [email protected]@[email protected]
 *                          :@[email protected],[email protected]@O                                                          ,
 
[email protected]@[email protected]@Br
 *                          @[email protected]   [email protected]@BS                                                      [email protected]@@@[email protected]
 *                         [email protected]@B      [email protected]
 
@i                                                  [email protected]@@[email protected]@
 *                        ,[email protected]:        [email protected]@@Z                                               [email protected]@[email protected]
 *                        [email protected]          :@[email protected]                                            [email protected]@[email protected]@.
 *                       :@[email protected]             @@@B:                                        [email protected]@[email protected]
 *                       @[email protected]              [email protected]@B.               ..::ir7vvYUuU777r::.   [email protected]@[email protected]@S
 *                       [email protected],               [email protected]  :[email protected]@[email protected]@[email protected]@[email protected]@[email protected]@@@[email protected]@[email protected]@[email protected]@[email protected]
 *                      [email protected]@                 @[email protected]@[email protected]@[email protected]@@[email protected]@[email protected]@[email protected]@[email protected]@@
 *                      @[email protected]                 [email protected]@@@MSur:.                    [email protected]@@@
 *                      @@@.                                                [email protected]@@B
 *                     [email protected]@                                                 [email protected]@[email protected]
 *                     [email protected]                                                  @@@[email protected]@B
 *                     @@BS                                                  [email protected]@@[email protected]@
 *                     @@@7                                                   [email protected]@[email protected]
 *                     [email protected]                                                    [email protected]@[email protected]@7
 *                    [email protected]@:                                                     [email protected]@[email protected]@M
 *                  [email protected]@,                                                        [email protected]@@[email protected]@[email protected]@[email protected]@
 *                 [email protected]                                                            [email protected]@[email protected]@[email protected]@@@@[email protected]@[email protected]: @@@B
 *                [email protected]:                                                                 [email protected]@[email protected]@[email protected]:      @[email protected]
 *               [email protected]                                              ,v.                                        @[email protected]
 *              [email protected],                         Y7                    @[email protected]                                      [email protected]@
 *   :[email protected]@@B2:  @@B7                         @[email protected]                   [email protected]@[email protected]:                                   [email protected]
 *    [email protected]@@[email protected]@[email protected]                        [email protected]@B                       [email protected]@[email protected]@Ou:                              [email protected]
 *         :[email protected]@[email protected]@2.           :7::::[email protected]@[email protected]                           :[email protected]@[email protected]@[email protected]@G.                       @[email protected]
 *            [email protected]@@[email protected]@         :@[email protected]@@@[email protected]@@1                                 [email protected]@[email protected]@@5                       [email protected]@2
 *            [email protected] ,@B1          L0EZZG0F7:                                            .:,                        [email protected]@M7
 *           [email protected]@                                                                                               ,[email protected]@[email protected]@B
 *           @[email protected]                                                     :@[email protected]@@r                                :@@@@[email protected]:,,
 *           [email protected]                         :2ZS;                      :@[email protected]@[email protected]                               [email protected]@[email protected]
 *           @[email protected]                        @@@[email protected]@                     [email protected]@[email protected]                                   @[email protected]
 *           [email protected]                        [email protected]@[email protected]                     [email protected]@[email protected]                                   ,[email protected]
 *           @[email protected]                         @[email protected]@@@i                       rL7.                                    [email protected]
 *           [email protected]:                       [email protected]@M.                                                               [email protected]@.
 *  .;[email protected]@@[email protected]@[email protected]@.                                                                                       .  @[email protected]
 *@@@[email protected]@[email protected]@@@[email protected]                                                                                      :[email protected]@[email protected],
 *[email protected]    ,@@B                                                                                          [email protected]@[email protected]@[email protected]
 *            @@@U                                                                                           [email protected]@[email protected]@i
 *            [email protected]@                                                                                         :[email protected]     [email protected]@
 *             [email protected]@                                                                                       [email protected]@k         2i
 *              [email protected]                                      .7jXEGqF7:                                     [email protected]@L
 *              [email protected]                                   [email protected]@[email protected]@[email protected]@.                                 :@[email protected]:
 *               [email protected]@                                   @@MYr::[email protected]                                [email protected]@G
 *                 [email protected]@@S                                                                           ,[email protected]@,
 *                  [email protected]@@BF                                                                      [email protected]@Br
 *                    [email protected]@[email protected]                                                                ,[email protected]@@B8,
 *                      [email protected]@[email protected],                                                        :[email protected]@[email protected]
 *                         [email protected]@[email protected]@P7,                                           [email protected]@[email protected]@[email protected]@[email protected]
 *                            ,[email protected]@[email protected]@@@BOP2L7i:,.              ..,:[email protected]@[email protected]@@@[email protected]@[email protected];[email protected]@
 *                              @[email protected]@[email protected]@@[email protected]@[email protected]@[email protected]@[email protected]@@@[email protected]@[email protected]@[email protected]@@[email protected]@[email protected]@BM0SJ7i::::i:,[email protected]@
 *                              [email protected] ::i;[email protected]@[email protected]@[email protected]@[email protected]@@@B1UFuj77ii:::::::iir;r;[email protected]
 *                              @[email protected]:i:i:i::::::::::[email protected]@BMYi:i;[email protected]@N:.::i:iirir;r;rii::::[email protected]@
 *                              [email protected]@X::,::::iirir;riri:[email protected]@1         ,@[email protected]:;;r;rii:i::::[email protected]@@@@B
 *                              @@@[email protected]:::::::[email protected]@@i  ..,..     @[email protected]@,,:::::[email protected]@[email protected]@[email protected]@:
 *                             [email protected]@@@[email protected]@[email protected]@[email protected] .,,:,,  :.   @[email protected]@[email protected]@[email protected]@@@BS:   @@B1
 *                             [email protected]@   [email protected]@[email protected]@[email protected]@[email protected] .,:,,[email protected]@[email protected] [email protected]@[email protected]@[email protected]@BM57.        [email protected]
 *                            [email protected]@:          .,[email protected]@u  ..,.. [email protected]@@@[email protected],                 ,@[email protected]
 *                            @@@8                   [email protected]@:    .     :[email protected]@@                       [email protected]@2
 *                          [email protected]@@@                     [email protected]@u          [email protected]@B.                       [email protected]
 *                         ,@[email protected]                       [email protected]@BOv:.:[email protected]@M                          @[email protected]
 *                          vNi                          [email protected]@[email protected]@[email protected]@BM:                            [email protected]
 *                                                          758BMqJ,
 *
 *                 .  YO.               vq                            :G       Z:
 *        [email protected]@Br @@r rBE           @B     [email protected]@@@@[email protected]    i::::.OB1.:::[email protected]::::i           @[email protected]@U:@@[email protected]@BPEBu
 *        [email protected]@[email protected]    [email protected]  [email protected]        BM     [email protected]@Z   [email protected]@[email protected]@@@[email protected]@[email protected]@[email protected]@@[email protected]   [email protected]@1 BX :@k [email protected]:
 *            iB      iBi    [email protected]     [email protected]@BGMZZ         @@F            ,B       Pi          [email protected]  Bq @i [email protected]        [email protected]
 *       [email protected]@Z7LLri;72.   [email protected]@@       @BX         @@@[email protected]@@@@@[email protected]@@[email protected]@B      [email protected]  @F Bi @q  @[email protected] @B
 *       [email protected]@[email protected]@@[email protected]@[email protected]@,     [email protected]   @@      .Bk          .:u;    [email protected]:      Zv       [email protected]  Bk @,;@  ,BY @B [email protected]
 *            [email protected]       @G     5.      ,@v   BZ :::,[email protected] .::i,      @B     [email protected]    [email protected]       [email protected]  @F B:[email protected] [email protected]  @M @B
 *            7B: ,vO, @@   [email protected]:      @B   [email protected]:[email protected]@[email protected]@@[email protected]@BM       @@.    B:  [email protected]         [email protected]  BS @i [email protected]  B. @O [email protected]
 *       ,[email protected]@[email protected] [email protected]  @BB        [email protected]   @B        @S              :    [email protected]   ..          7B  @F @7  B7 @  @B @B
 *       [email protected]@UOBr       @[email protected]          [email protected]        .BZ        [email protected]@[email protected]@[email protected]@[email protected]@[email protected]@[email protected]@,   [email protected]  BF @i  @G [email protected]@B [email protected]
 *            [email protected],      [email protected]    ;r        @@@.       [email protected]                [email protected]           [email protected]@q BP:[email protected] @u,.  @B
 *            LBi   [email protected]@    @@       @B:[email protected]      BM             [email protected]  rB  [email protected]         [email protected] Pi @XZ8r  .     [email protected]
 *        .   [email protected] [email protected]  ,[email protected],  @B    [email protected]    N, [email protected]         ,[email protected]    [email protected],   [email protected]@B1r           Br           @@
 *        [email protected]@B  ,i       [email protected]@B,    [email protected]:        @[email protected]@F         [email protected]:      [email protected]      :OBZ          [email protected]       [email protected]@B:
 *                          .ll                                           rB.                     :
 */
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define SonG_y main
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 2507;
const int dir[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int N, M, tot;
string month; int day, year, hour; ll need[maxN];  //月、日、年、小時、需求
int T, S;
int real_Time[maxN];
int get_month(string ss)
{
    if(ss == "Jan") return 1;
    else if(ss == "Feb") return 2;
    else if(ss == "Mar") return 3;
    else if(ss == "Apr") return 4;
    else if(ss == "May") return 5;
    else if(ss == "Jun") return 6;
    else if(ss == "Jul") return 7;
    else if(ss == "Aug") return 8;
    else if(ss == "Sep") return 9;
    else if(ss == "Oct") return 10;
    else if(ss == "Nov") return 11;
    else return 12;
}
inline bool lucky_year(int NEW_year) { return (NEW_year%4 == 0 && NEW_year%100 != 0) || (NEW_year%400 == 0); }
inline void get_TIME(int i)
{
    int tmp = hour;
    tmp += (day - 1) * 24;
    int yue = get_month(month);
    for(int i=1; i<yue; i++)
    {
        if(i == 2 && lucky_year(year)) tmp += 29 * 24;
        else tmp += dir[i] * 24;
    }
    for(int i=2000; i<year; i++)
    {
        if(lucky_year(i)) tmp += 366 * 24;
        else tmp += 365 * 24;
    }
    real_Time[i] = tmp;
}
const int maxM = 2e5 + 7;
ll order[maxM];
ll cost[maxM], minn[maxM];
ll ans = 0;
struct node
{
    ll val;
    int id;
    node(ll a=INF, int b=0):val(a), id(b) {}
}p[maxM];
inline void get_MInn(int nn, int kk)    //總長、區間長度
{
    int head = 1, tail = 0;
    for(int i=0; i<kk-1; i++)
    {
        while(head<=tail && p[tail].val>=cost[i]) tail--;
        p[++tail] = node(cost[i], i);
        if(order[i]) ans += order[i] * ( p[head].val - (tot - i) * S );
    }
    for(int i=kk-1; i<=nn; i++)
    {
        while(head<=tail && p[tail].val>=cost[i]) tail--;
        p[++tail] = node(cost[i], i);
        while(p[head].id <= i - kk + 1) head++;
        minn[i - kk + 1] = p[head].val;
        if(order[i]) ans += order[i] * ( minn[i - kk + 1] - (tot - i) * S );
    }
}
int SonG_y()
{
    while(scanf("%d%d", &N, &M) && (N | M))
    {
        memset(order, 0, sizeof(order));
        for(int i=1; i<=N; i++)
        {
            cin>>month;
            scanf("%d%d%d%lld", &day, &year, &hour, &need[i]);
            get_TIME(i);
            order[real_Time[i]] += need[i];
        }
        scanf("%d%d", &T, &S);
        tot = T + M - 1;    //這一天是最後的期限
        for(int i=0; i<M; i++)
        {
            scanf("%lld", &cost[i]);
            cost[i] += S * (tot - i);
        }
        for(int i=M; i<=tot; i++) cost[i] = INF;
        ans = 0;
        get_MInn(tot, T+1);
        printf("%lld\n", ans);
    }
    return 0;
}
/*
1 10
Jan 1 2000 2 10
5 2
20
20
20
10
10
8
7
9
5
10
 ans:240
*/

/*
 *                             UM.
 *                            [email protected]@1                                                                    [email protected]
 *                           [email protected]@@[email protected]                                                              [email protected]@[email protected]
 *                          :@[email protected],[email protected]@O                                                          ,[email protected]@[email protected]@Br
 *                          @[email protected]   [email protected]@BS                                                      [email protected]@@@[email protected]
 *                         [email protected]@B      [email protected]@i                                                  [email protected]@@[email protected]@
 *                        ,[email protected]:        [email protected]@@Z                                               [email protected]@[email protected]
 *                        [email protected]          :@[email protected]                                            [email protected]@[email protected]@.
 *                       :@[email protected]             @@@B:                                        [email protected]@[email protected]
 *                       @[email protected]              [email protected]@B.               ..::ir7vvYUuU777r::.   [email protected]@[email protected]@S
 *                       [email protected],               [email protected]  :[email protected]@[email protected]@[email protected]@[email protected]@[email protected]@@@[email protected]@[email protected]@[email protected]@[email protected]
 *                      [email protected]@                 @[email protected]@[email protected]@[email protected]@@[email protected]@[email protected]@[email protected]@[email protected]@@
 *                      @[email protected]                 [email protected]@@@MSur:.                    [email protected]@@@
 *                      @@@.                                                [email protected]@@B
 *                     [email protected]@                                                 [email protected]@[email protected]
 *                     [email protected]                                                  @@@[email protected]@B
 *                     @@BS                                                  [email protected]@@[email protected]@
 *                     @@@7                                                   [email protected]@[email protected]
 *                     [email protected]                                                    [email protected]@[email protected]@7
 *                    [email protected]@:                                                     [email protected]@[email protected]@M
 *                  [email protected]@,                                                        [email protected]@@[email protected]@[email protected]@[email protected]@
 *                 [email protected]                                                            [email protected]@[email protected]@[email protected]@@@@[email protected]@[email protected]: @@@B
 *                [email protected]:                                                                 [email protected]@[email protected]@[email protected]:      @[email protected]
 *               [email protected]                                              ,v.                                        @[email protected]
 *              [email protected],                         Y7                    @[email protected]                                       
 

            
  
           

              
              
            
            
相關推薦
			   
            
            
            
 

    

    
    
Alice&#39;s mooncake shop【HDU 4122】【單調佇列】
     
  
 
 
 題目連結 
 
   這道題還稍微有了點坑點，就是一開始過了的時候沒想到的，就是在一開始處理的時候，我們用到單調佇列，但是單調佇列一開始，我用陣列模擬，所以先放進去了區間長度-1個元素，但是，這個時候，就會有問題，就是，如果期限剛好在區間內的話，我們就會少去這個答案，所以不行！我們一邊 

  
 

    

    
    
HDU 5558 Alice&#39;s Classified Message——字尾陣列+set+二分+rmq
     
  
 
 
 15合肥簽到題，不會後綴自動機只能用字尾陣列來湊了 
 我們要完成的工作是對s的每一個字尾suf[i]，找以j(0<=j<i)為起點的一個子串，使得這個子串與suf[i]的公共字首儘量長 
 其實字尾陣列的做法挺明顯的，就是對於一個字尾suf[i]，首先將它前面的字尾的rank值用s 

  
 

    

    
    
[HDU3544] Alice&#39;s Game(網上有些講解是錯的)
     
  
 
  
  
 
 
  文章目錄
  
   [HDU3544] Alice's Game
   
    
     題意：
     分析：
     參考程式碼
     
      初級
      簡化
     
    
   
  
 
  
 [HDU3544] Alice’s G 

  
 

    

    
    
Alice&#39;s Chance POJ - 1698（按時間點建邊）
     
 
 Alice's Chance
 
 
  
   
    
    Time Limit: 1000MS 
      
    Memory Limit: 10000K 
    
    
    Total Submissions: 7791 
    &n 

  
 

    

    
    
「日常訓練」Uncle Tom&#39;s Inherited Land*（HDU-1507）
     
 題意與分析 
題意是這樣的：給你一個\(N\times M\)的圖，其中有一些點不能放置\(1\times 2\)大小的矩形，矩形可以橫著放可以豎著放，問剩下的格子中，最多能夠放多少個矩形。 注意到是\(1\times 2\)的矩形，所以是一個\(i+j\)和為奇數的可以與\(i+j\)為偶數的相連。抽象座標 

  
 

    

    
    
zz&#39;s Mysterious Present（HDU-2145）
     
  
 
 
 Problem Description 
 There are m people in n cities, and they all want to attend the party which hold by zz. They set out at the same time, and the 

  
 

    

    
    
hdu4791-Alice&#39;s Print Service
     
 數字   scan   con   continue   com   code   bound   namespace   blank   題目鏈接：http://acm.hdu.edu.cn/showproblem.php?pid=4791

題目解釋：給你一組數據s1,p1,s2,p2...sn,pn 

  
 

    

    
    
HDU 6319&&18多校3A  Ascending Rating 【單調佇列】
     
 
                
			Problem A. Ascending Rating
			Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
			Total Submiss 

  
 

    

    
    
HDU 6319 Ascending Rating 單調佇列,(最大值變化次數)
     
  
 
 題意:長度為n的序列a.對每個m大小的區間[i,i+m-1],求出該區間的最大值,以及最大值變化的次數. 例如區間(4,2,7,5),最大值變化次數為2. n<=1e7. 
 n<=1e7. 標準解應該為O(n). 容易想到用單調佇列維護每個區間的最大值. 發現正著做單調佇列的過程中,單 

  
 

    

    
    
【單調佇列】【P3957】 跳房子
     
 傳送門 
Description 
跳房子，也叫跳飛機，是一種世界性的兒童遊戲，也是中國民間傳統的體育遊戲之一。 
跳房子的遊戲規則如下： 
在地面上確定一個起點，然後在起點右側畫 $n$ 個格子，這些格子都在同一條直線上。每個格子內有一個數字（整數），表示到達這個 格子能得到的分數。玩家第一次從起點開始向右 

  
 

    

    
    
【死磕演算法·棧和佇列】滑動視窗問題-雙端佇列
     
  
 
 題目要求： 
 有一個整型陣列 arr 和一個大小為 w 的視窗，從陣列的最左邊滑到最右邊,視窗每次向右邊滑一個位置。 返回一個長度為n-w+1的陣列res，res[i]表示每一種視窗狀態下的最大值。 
 以陣列為[4,3,5,4,3,3,6,7]，w=3為例。因為第一個視窗[4,3,5]的最大值為 

  
 

    

    
    
洛谷P3594 [POI2015]WIL-Wilcze doły【單調佇列】
     
 
								
								            
							
							
							時空限制 1000ms / 128MB
題目描述
給定一個長度為n的序列，你有一次機會選中一段連續的長度不超過d的區間，將裡面所有數字全部修改為0。請找到最長的一段連續區間，使得該區間內所有數字之和不超 

  
 

    

    
    
3530 Subsequence【單調佇列】
     
 
							
							
							Time limit 1000 ms
Memory limit 32768 kB
There is a sequence of integers. Your task is to find the longest subsequence that satisfi 

  
 

    

    
    
POJ2823 Sliding Window【單調佇列】【線段樹】【ST表】
     
 
                Sliding Window



題意：

給出一個長度為N的序列，通過一個視窗，可以看到序列中連續的K個元素，視窗從最左邊出發，每次移動一個單位，對於每次移動，輸出當前視窗中的最大值和最小值

單調遞減佇列：從隊頭到隊尾單調遞減的佇列

入隊操作，先把隊尾元素中小於X的元 

  
 

    

    
    
【死磕演算法·棧與佇列】如何用雙棧實現佇列操作？
     
  
 
 題目要求： 
 編寫一個類，只能用兩個棧結構實現佇列，支援佇列的基本操作add(),poll(),peek() 
 題目思路: 
 棧是先進後出，佇列是先進先出。用兩個棧可以將順序反過來，實現佇列操作 
 設定兩個棧stackPush（壓入棧）和stackPop(彈出棧)，一個只進行push操作，一 

  
 

    

    
    
【死磕演算法·棧和佇列】雙棧排序問題
     
  
 
 題目要求：一個棧中元素型別為整型，現在想將該棧自頂到底從大到小排序（vector中第一個元素為棧頂），只能申請一個棧，除此之外可以申請新的變數，但不能申請額外的資料結構，如何完成排序？ 
 思路：記原來的棧為stack，申請的輔助棧為help，設定help自頂到底從小到大排序，即可將help倒入st 

  
 

    

    
    
【死磕演算法·棧和佇列】僅用遞迴實現棧的逆序
     
  
 
 題目要求：實現棧的逆序，但只能用遞迴函式和這個棧本身操作來實現，不能自己申請額外的資料結構。 
 題目思路： 
 實現兩個遞迴函式：  
 getBottomItem()：移除棧底元素並返回該元素 
 reverse():實現整個棧逆序 
   
 如何寫遞迴函式？ 
 遞迴函式在函式體中 

  
 

    

    
    
【死磕演算法·棧和佇列】如何實時查詢棧中最小值
     
  
 
 題目大意：實現一個特殊的棧，在實現棧的基本功能的基礎上，實現返回棧中最小元素的操作getmin() 
 要求：設計的棧型別可以使用現成的棧結構，其中 pop（）、push（）、getMin（）操作的時間複雜度為O(1) 
 題目思路（涉及到棧操作）： 
 方法一： 
 1、設定兩個同步操作的棧 st 

  
 

    

    
    
【貪心+並查集/優先佇列】POJ1456 Supermarket
     
 
 Supermarket
 
 
  
   
    
    Time Limit: 2000MS 
      
    Memory Limit: 65536K 
    
    
    Total Submissions: 17974 
    &nbs 

  
 

    

    
    
【單調佇列】【動態規劃】[CQBZOJ3059]Bead
     
 
								
								            
							
							
							題目描述

Alex 喜歡玩網路遊戲，認為這是智力和體力的綜合鍛鍊。在一次遊戲活動中， 
他意外獲得了一個傳說中威力極其強大的法寶：珠鏈。 
珠鏈，顧名思義，就是由許多小珠子串起來的一條鏈。珠子有很多種