bzoj5194 [Usaco2018 Feb]Snow Boots（离线+贪心+并查集）

都按S排序以后，每次把不能走的染黑，如果任意一段连续的黑色个数小于< d的话我就可以通过，否则不行。可以用并查集来维护最大子段和。复杂度O(nlogn)

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,m,fa[N],sz[N],mx=0;
bool ans[N];
struct data{
    int id,s,d;
}a[N];
struct tile{
    int id,s;
}b[N];
inline bool cmp(data a,data b){return a.s>b.s;}
inline bool cmp1(tile a,tile b){return a.s>b.s;}
inline int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
inline void add(int x){
    fa[x]=x;sz[x]=1;mx=max(mx,sz[x]);
    if(fa[x-1]){
        int xx=find(x-1);
        fa[xx]=x;sz[x]+=sz[xx];
        mx=max(mx,sz[x]);
    }if(fa[x+1]){
        int xx=find(x+1);
        fa[x]=xx;sz[xx]+=sz[x];mx=max(mx,sz[xx]);
    }
}
int main(){
//  freopen("snowboots.in","r",stdin);
//  freopen("snowboots.out","w",stdout);
    n=read();m=read();
    for(int i=1;i<=n;++i) b[i].id=i,b[i].s=read();
    for(int i=1;i<=m;++i) a[i].id=i,a[i].s=read(),a[i].d=read();
    sort(a+1,a+m+1,cmp);sort(b+1,b+n+1,cmp1);int now=1;
    for(int i=1;i<=m;++i){
        while(now<=n&&b[now].s>a[i].s) add(b[now].id),++now;
        if(a[i].d>mx) ans[a[i].id]=1;
        else ans[a[i].id]=0;
    }for(int i=1;i<=m;++i) printf("%d\n",ans[i]);
    return 0;
}