[单调栈专题]

https://vjudge.net/contest/296911#overview

A - Subsequence

 

There is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference between the maximum element and the minimum element of the subsequence is no smaller than m and no larger than k.

Input

There are multiple test cases. 
For each test case, the first line has three integers, n, m and k. n is the length of the sequence and is in the range [1, 100000]. m and k are in the range [0, 1000000]. The second line has n integers, which are all in the range [0, 1000000]. 
Proceed to the end of file. 
Output

For each test case, print the length of the subsequence on a single line.

Sample Input

5 0 0
1 1 1 1 1
5 0 3
1 2 3 4 5

Sample Output

5
4
题意：求满足区间内最大元素值-最小元素值>=m&&<=k的最长区间长度
题解：两个单调栈，一个栈维护一个递增序列，另一个栈维护一个递减序列，通过二者差值<=k移动head指针，然后检查是否>=m更新ans

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
#define debug(x,y,z) cout<< #x <<" is "<<x<<" "<< #y <<" is "<<y<<" "<< #z <<" is "<<z<<endl;
#define debugs(x) cout<< #x <<" is "<<x<<endl;
const ll inf=1e10;
ll a[100005];
int q[100005],w[100005];
int main()
{
    int n,m,k;
    while(scanf("%d",&n)==1){
        scanf("%d%d",&m,&k);
        for(int i=1;i<=n;i++){
            scanf("%lld",&a[i]);
        }
        int ans=0;
        int head,tail,head2,tail2;
        head=1;
        tail=0;
        head2=1;
        tail2=0;
        int pre=1;
        for(int i=1;i<=n;i++){
            while(tail>=head&&a[q[tail]]>a[i])tail--;
            while(tail2>=head2&&a[w[tail2]]<a[i])tail2--;
            q[++tail]=i;
            w[++tail2]=i;
            while(head<=tail&&head2<=tail2&&a[w[head2]]-a[q[head]]>k){
                if(q[head]<w[head2]){
                    pre=q[head++]+1;
                }
                else{
                    pre=w[head2++]+1;
                }
            }
            if(a[w[head2]]-a[q[head]]<=k&&a[w[head2]]-a[q[head]]>=m){
                ans=max(ans,i-pre+1);
            }
           // debugs(w[head2]);
           // debugs(q[head]);
        }
        printf("%d\n",ans);
    }
    return 0;
}

B - Second My Problem First

Give you three integers n, A and B. 
Then we define S _i = A ⁱ mod B and T _i = Min{ S _k | i-A <= k <= i, k >= 1} 
Your task is to calculate the product of T _i (1 <= i <= n) mod B.

Input

Each line will contain three integers n(1 <= n <= 10 ⁷),A and B(1 <= A, B <= 2 ³¹-1). 
Process to end of file.

Output

For each case, output the answer in a single line.

Sample Input

1 2 3
2 3 4
3 4 5
4 5 6
5 6 7

Sample Output

2
3
4
5
6

 题意： S _i = A ⁱ mod B ，T _i = Min{ S _k | i-A <= k <= i, k >= 1} ，求Ti(1<=i<=n)乘积%B的结果

题解：水题。直接维护一个单调栈即可线性求出所有Ti

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
#define debug(x,y,z) cout<< #x <<" is "<<x<<" "<< #y <<" is "<<y<<" "<< #z <<" is "<<z<<endl;
#define debugs(x) cout<< #x <<" is "<<x<<endl;
int a[10000005],b[10000005];
int main()
{
    ll n,A,B;
    while(scanf("%lld%lld%lld",&n,&A,&B)==3){
        a[0]=1;
        for(int i=1;i<=n;i++)a[i]=a[i-1]*A%B;
        int head=1;
        int tail=0;
        ll ans=1;
        for(int i=1;i<=n;i++){
            while(head<=tail&&a[b[tail]]>=a[i])tail--;
            b[++tail]=i;
            while(head<=tail&&(b[head])<(i-A))head++;
            ans=ans*a[b[head]]%B;
        }
        printf("%lld\n",ans);
    }
    return 0;
}

D - Largest Rectangle in a Histogram

A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the left shows the histogram that consists of rectangles with the heights 2, 1, 4, 5, 1, 3, 3, measured in units where 1 is the width of the rectangles: 

Usually, histograms are used to represent discrete distributions, e.g., the frequencies of characters in texts. Note that the order of the rectangles, i.e., their heights, is important. Calculate the area of the largest rectangle in a histogram that is aligned at the common base line, too. The figure on the right shows the largest aligned rectangle for the depicted histogram.

Input

The input contains several test cases. Each test case describes a histogram and starts with an integer n, denoting the number of rectangles it is composed of. You may assume that 1<=n<=100000. Then follow n integers h₁,...,h_n, where0<=h_i<=1000000000. These numbers denote the heights of the rectangles of the histogram in left-to-right order. The width of each rectangle is 1. A zero follows the input for the last test case.

Output

For each test case output on a single line the area of the largest rectangle in the specified histogram. Remember that this rectangle must be aligned at the common base line.

Sample Input

7 2 1 4 5 1 3 3
4 1000 1000 1000 1000
0

Sample Output

8
4000

Hint

Huge input, scanf is recommended.

题意：给出各个矩形的高度，求出合并后最大的矩形面积

题解：枚举高度的最小值(即枚举最低矩形的编号)，然后正向维护一个单调栈反向维护一个单调栈即可求出矩形长，长*宽即可

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
#define debug(x,y,z) cout<< #x <<" is "<<x<<" "<< #y <<" is "<<y<<" "<< #z <<" is "<<z<<endl;
#define debugs(x) cout<< #x <<" is "<<x<<endl;
ll a[100005],b[100005],c[100005],d[100005];
int main()
{
    int n;
    while(scanf("%d",&n)&&n){
        for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
        int tot=0;
        b[0]=0;
        for(int i=1;i<=n;i++){
            while(tot&&a[b[tot]]>=a[i])tot--;
            c[i]=b[tot]+1;
            b[++tot]=i;
        }
        b[0]=n+1;
        tot=0;
        for(int i=n;i>=1;i--){
            while(tot&&a[b[tot]]>=a[i])tot--;
            d[i]=b[tot]-1;
            b[++tot]=i;
        }
        ll ans=0;
        for(int i=1;i<=n;i++){
            ans=max(ans,(d[i]-c[i]+1)*a[i]);
        }
        printf("%lld\n",ans);
    }
    return 0;
}

E - Queue

 

There are n walruses standing in a queue in an airport. They are numbered starting from the queue's tail: the 1-st walrus stands at the end of the queue and the n-th walrus stands at the beginning of the queue. The i-th walrus has the age equal to a_i.

The i-th walrus becomes displeased if there's a younger walrus standing in front of him, that is, if exists such j (i < j), that a_i > a_j. The displeasure of the i-th walrus is equal to the number of walruses between him and the furthest walrus ahead of him, which is younger than the i-th one. That is, the further that young walrus stands from him, the stronger the displeasure is.

The airport manager asked you to count for each of n walruses in the queue his displeasure.

Input

The first line contains an integer n (2 ≤ n ≤ 10⁵) — the number of walruses in the queue. The second line contains integers a_i (1 ≤ a_i ≤ 10⁹).

Note that some walruses can have the same age but for the displeasure to emerge the walrus that is closer to the head of the queue needs to be strictly younger than the other one.

Output

Print n numbers: if the i-th walrus is pleased with everything, print "-1" (without the quotes). Otherwise, print the i-th walrus's displeasure: the number of other walruses that stand between him and the furthest from him younger walrus.

Examples

Input

6
10 8 5 3 50 45

Output

2 1 0 -1 0 -1 

Input

7
10 4 6 3 2 8 15

Output

4 2 1 0 -1 -1 -1 

Input

5
10 3 1 10 11

Output

1 0 -1 -1 -1 
题意：求出对于每个元素来说在自己右边且比自己小的元素离自己的最远距离
题解：维护一个单调栈，然后就可以二分单调栈求出最远的比自己小的元素

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
#define debug(x,y,z) cout<< #x <<" is "<<x<<" "<< #y <<" is "<<y<<" "<< #z <<" is "<<z<<endl;
#define debugs(x) cout<< #x <<" is "<<x<<endl;
int a[100005],b[100005],c[100005],d[100005];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    //int head=1;
    int tail=0;
    for(int i=n;i>=1;i--){
        if(tail==0||-b[tail]>=a[i]){
            c[i]=-1;
            b[++tail]=-a[i];
            d[tail]=i;
        }
        else{
            int pos=upper_bound(b+1,b+1+tail,-a[i])-b;
            c[i]=d[pos]-i-1;
        }
    }
    for(int i=1;i<=n;i++){
        printf("%d",c[i]);
        char cc=(i==n)?'\n':' ';
        printf("%c",cc);
    }
    return 0;
}

F - Watching Fireworks is Fun

 

A festival will be held in a town's main street. There are n sections in the main street. The sections are numbered 1 through n from left to right. The distance between each adjacent sections is 1.

In the festival m fireworks will be launched. The i-th (1 ≤ i ≤ m) launching is on time t_i at section a_i. If you are at section x (1 ≤ x ≤ n) at the time of i-th launching, you'll gain happiness value b_i - |a_i - x| (note that the happiness value might be a negative value).

You can move up to d length units in a unit time interval, but it's prohibited to go out of the main street. Also you can be in an arbitrary section at initial time moment (time equals to 1), and want to maximize the sum of happiness that can be gained from watching fireworks. Find the maximum total happiness.

Note that two or more fireworks can be launched at the same time.

Input

The first line contains three integers n, m, d (1 ≤ n ≤ 150000; 1 ≤ m ≤ 300; 1 ≤ d ≤ n).

Each of the next m lines contains integers a_i, b_i, t_i (1 ≤ a_i ≤ n; 1 ≤ b_i ≤ 10⁹; 1 ≤ t_i ≤ 10⁹). The i-th line contains description of the i-th launching.

It is guaranteed that the condition t_i ≤ t_i + 1 (1 ≤ i < m) will be satisfied.

Output

Print a single integer — the maximum sum of happiness that you can gain from watching all the fireworks.

Please, do not write the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.

Examples

Input

50 3 1
49 1 1
26 1 4
6 1 10

Output

-31

Input

10 2 1
1 1000 4
9 1000 4

Output

1992
题意：有m种烟花，每种烟花有一个最佳观看地点ai，在x处观看烟花得到的快乐值为 bi-abs(ai-x)，释放时刻为ti，你的初始位置可以是1~n的任意点，每秒可以移动d米,求欢乐值之和的最大值

 题解：设dp[i][j]表示在j处观看第i种烟花的最大值，则dp[i][j]=max(dp[i-1][k])+b[i]-abs(a[i]-j) 其中(a[i]-(t[i]-t[i-1])*d<=k<=a[i]+(t[i]-t[i-1])*d)，所以可以使用单调队列加速dp

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
#define debug(x,y,z) cout<< #x <<" is "<<x<<" "<< #y <<" is "<<y<<" "<< #z <<" is "<<z<<endl;
#define debugs(x) cout<< #x <<" is "<<x<<endl;
struct pot{
    ll tim;
    ll a;
    ll b;
}p[305];
int q[150005],w[150005];
ll dp[2][150005];
map<int,int>mp;
const ll inf=1e18;
int main()
{
    int n,m,d;
    scanf("%d%d%d",&n,&m,&d);
    int tot=0;
    for(int i=1;i<=m;i++){
        scanf("%I64d%I64d%I64d",&p[i].a,&p[i].b,&p[i].tim);
        if(!mp[p[i].tim])mp[p[i].tim]=++tot;
    }
    ll ans=-inf;
    int t=-1;
    int id=0;
    for(int i=1;i<=m;i++){
        int head=1;
        int tail=0;
        int k=1;
        if(p[i].tim==t){
            for(int j=1;j<=n;j++){
                dp[id][j]=dp[id^1][j]+p[i].b-abs(p[i].a-j);
            }
        }
        else{
            for(int j=1;j<=n;j++){
                dp[id][j]=-inf;
                while(k<=n&&k<=j+(p[i].tim-t)*d){
                    while(head<=tail&&dp[id^1][k]>dp[id^1][q[tail]])tail--;
                    q[++tail]=k;
                    k++;
                }
                while(head<=tail&&q[head]<j-(p[i].tim-t)*d)head++;
                if(head<=tail)dp[id][j]=dp[id^1][q[head]]+p[i].b-abs(p[i].a-j);
            }
            t=p[i].tim;
        }
        id^=1;
    }
    for(int i=1;i<=n;i++){
      //  debugs(dp[m][i]);
        ans=max(dp[id^1][i],ans);
    }
    printf("%I64d\n",ans);
    return 0;
}