Codeforces Beta Round #6 (Div. 2 Only) 单调队列

题目链接：

http://codeforces.com/contest/6/problem/E

E. Exposition

time limit per test 1.5 seconds
memory limit per test 64 megabytes #### 问题描述 > There are several days left before the fiftieth birthday of a famous Berland's writer Berlbury. In this connection the local library decided to make an exposition of the works of this famous science-fiction writer. It was decided as well that it is necessary to include into the exposition only those books that were published during a particular time period. It is obvious that if the books differ much in size, the visitors will not like it. That was why the organizers came to the opinion, that the difference between the highest and the lowest books in the exposition should be not more than k millimeters. > > The library has n volumes of books by Berlbury, arranged in chronological order of their appearance. The height of each book in millimeters is know, it is hi. As Berlbury is highly respected in the city, the organizers want to include into the exposition as many books as possible, and to find out what periods of his creative work they will manage to cover. You are asked to help the organizers cope with this hard task. #### 输入 > The first line of the input data contains two integer numbers separated by a space n (1 ≤ n ≤ 105) and k (0 ≤ k ≤ 106) — the amount of books by Berlbury in the library, and the maximum allowed height difference between the lowest and the highest books. The second line contains n integer numbers separated by a space. Each number hi (1 ≤ hi ≤ 106) is the height of the i-th book in millimeters. #### 输出 > In the first line of the output data print two numbers a and b (separate them by a space), where a is the maximum amount of books the organizers can include into the exposition, and b — the amount of the time periods, during which Berlbury published a books, and the height difference between the lowest and the highest among these books is not more than k milllimeters. > > In each of the following b lines print two integer numbers separated by a space — indexes of the first and the last volumes from each of the required time periods of Berlbury's creative work.

样例

sample input
3 3
14 12 10

sample output
2 2
1 2
2 3

题意

求所有的最长连续子串，满足最大值最小值之差小于等于k。

题解

用单调队列维护一下（写成优先队列了。。orz）

代码

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<ctime>
#include<vector>
#include<cstdio>
#include<string>
#include<bitset>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
#define X first
#define Y second
#define mkp make_pair
#define lson (o<<1)
#define rson ((o<<1)|1)
#define mid (l+(r-l)/2)
#define sz() size()
#define pb(v) push_back(v)
#define all(o) (o).begin(),(o).end()
#define clr(a,v) memset(a,v,sizeof(a))
#define bug(a) cout<<#a<<" = "<<a<<endl
#define rep(i,a,b) for(int i=a;i<(b);i++)
#define scf scanf
#define prf printf

typedef long long LL;
typedef vector<int> VI;
typedef pair<int,int> PII;
typedef vector<pair<int,int> > VPII;

const int INF=0x3f3f3f3f;
const LL INFL=0x3f3f3f3f3f3f3f3fLL;
const double eps=1e-8;
const double PI = acos(-1.0);

//start----------------------------------------------------------------------

const int maxn=1e5+10;

int n,k;
int arr[maxn];

int main() {
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++) scanf("%d",&arr[i]);
    priority_queue<pair<int,int> > qmax,qmin;
    int l=1,r=1,sum=-1;
    VPII ans;
    while(r<=n){
        qmax.push(mkp(arr[r],r));
        qmin.push(mkp(-arr[r],r));
        while(abs(qmax.top().X+qmin.top().X)>k){
            l++;
            while(qmax.top().Y<l) qmax.pop();
            while(qmin.top().Y<l) qmin.pop();
        }
        if(r-l+1>sum){
            sum=r-l+1;
            ans.clear();
            ans.push_back(mkp(l,r));
        }else if(r-l+1==sum){
            ans.push_back(mkp(l,r));
        }
        r++;
    }
    prf("%d %d
",sum,ans.sz());
    rep(i,0,ans.sz()){
        printf("%d %d
",ans[i].X,ans[i].Y);
    }
    return 0;
}

//end-----------------------------------------------------------------------