P2698 [USACO12MAR]花盆Flowerpot（单调队列+二分）

P2698 [USACO12MAR]花盆Flowerpot

一看标签........十分后悔

标签告诉你单调队列+二分了............

每次二分花盆长度，蓝后开2个单调队列维护最大最小值

蓝后就是code了

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
inline int Max(int a,int b){return a>b?a:b;}
void read(int &x){
    static char c=getchar();x=;
    while(c<''||c>'') c=getchar();
    while(''<=c&&c<='') x=x*+(c^),c=getchar();
}
#define N 100005
struct data{int x,y;}a[N];
inline bool cmp(data A,data B){return A.x<B.x;}
int n,d,h1[N],h2[N],L1,R1,L2,R2;
bool check(int len){
    int re=; L1=L2=; R1=R2=;
    for(int i=;i<=n;++i){
        while(L1<=R1&&a[h1[L1]].x<a[i].x-len) ++L1;
        while(L2<=R2&&a[h2[L2]].x<a[i].x-len) ++L2;
        while(L1<=R1&&a[h1[R1]].y>=a[i].y) --R1;
        while(L2<=R2&&a[h2[R2]].y<=a[i].y) --R2;
        h1[++R1]=h2[++R2]=i;
        re=Max(re,a[h2[L2]].y-a[h1[L1]].y);
    }return re<d;
}
int main(){
    read(n);read(d);
    for(int i=;i<=n;++i) read(a[i].x),read(a[i].y);
    sort(a+,a+n+,cmp);
    int l=,r=;
    while(l<r){
        int mid=(l+r)>>;
        if(check(mid)) l=mid+;
        else r=mid;
    }
    if(check(l)) puts("-1");
    else printf("%d",l);
    return ;
}