P2698 [USACO12MAR]Flowerpot S(单调队列)

Farmer John has been having trouble making his plants grow, and needs your help to water them properly. You are given the locations of N raindrops (1 <= N <= 100,000) in the 2D plane, where y represents vertical height of the drop, and x represents its location over a 1D number line:

Each drop falls downward (towards the x axis) at a rate of 1 unit per second. You would like to place Farmer John's flowerpot of width W somewhere along the x axis so that the difference in time between the first raindrop to hit the flowerpot and the last raindrop to hit the flowerpot is at least some amount D (so that the flowers in the pot receive plenty of water). A drop of water that lands just on the edge of the flowerpot counts as hitting the flowerpot.

Given the value of D and the locations of the N raindrops, please compute the minimum possible value of W.

老板需要你帮忙浇花。给出N滴水的坐标，y表示水滴的高度，x表示它下落到x轴的位置。

每滴水以每秒1个单位长度的速度下落。你需要把花盆放在x轴上的某个位置，使得从被花盆接着的第1滴水开始，到被花盆接着的最后1滴水结束，之间的时间差至少为D。

我们认为，只要水滴落到x轴上，与花盆的边沿对齐，就认为被接住。给出N滴水的坐标和D的大小，请算出最小的花盆的宽度W。

Input

第一行2个整数 N 和 D。

第2.. N+1行每行2个整数，表示水滴的坐标(x,y)。

Output

仅一行1个整数，表示最小的花盆的宽度。如果无法构造出足够宽的花盆，使得在D单位的时间接住满足要求的水滴，则输出-1。

Sample 1

Inputcopy	Outputcopy
4 5 6 3 2 4 4 10 12 15	2

Hint

【样例解释】

有4滴水， (6,3), (2,4), (4,10), (12,15).水滴必须用至少5秒时间落入花盆。花盆的宽度为2是必须且足够的。把花盆放在x=4..6的位置，它可以接到1和3水滴, 之间的时间差为10-3 = 7满足条件。

【数据范围】

40%的数据：1 ≤ N ≤ 1000，1 ≤ D ≤ 2000；

100%的数据：1 ≤ N ≤ 100000，1 ≤ D ≤ 1000000，0≤x,y≤10^6。

 

 

#include <iostream>
#include <algorithm>
using namespace std;
constexpr int N= 1e5 + 10;;
int n,d;
int q1[N],q2[N],tt1,tt2,hh1,hh2;
struct node{
    int x,y;
}a[N];
bool cmp(node s1,node s2){
    return s1.x<s2.x;
}
int  main(){
    scanf("%d%d",&n,&d);
    for(int i=1;i<=n;i++){
        scanf("%d%d",&a[i].x,&a[i].y);
    }
    sort(a+1,a+n+1,cmp);
    int ans=1e7+10;
    tt1 = tt2 = -1;
    for(int l=1,r=0;l<=n;l++){
        while(hh1<=tt1&&q1[hh1]<l)hh1++;
        while(hh2<=tt2&&q2[hh2]<l)hh2++;
        while(a[q1[hh1]].y-a[q2[hh2]].y<d&& r<n){
            r++;
            while(hh1<=tt1&&a[q1[tt1]].y<=a[r].y) tt1--;
            q1[++ tt1]=r;
            while(hh2<=tt2&&a[q2[tt2]].y>=a[r].y) tt2--;
            q2[++tt2]=r;
        }
        if(a[q1[hh1]].y-a[q2[hh2]].y>=d) ans= min(ans,a[r].x-a[l].x);
    }
    if(ans>=1e7)
        printf("-1\n");
    else
        printf("%d\n",ans);
    return 0;
}