cf484E. Sign on Fence

链接

点击跳转

题解

考虑这样一个过程：从大到小加入栅栏，直到所查询的区间中有连续某$w$个位置是都有栅栏的，这个时候所刚好加入的围栏的高度就是答案

可持久化线段树维护一下区间连续$1$的个数

每次二分查询就行了

时间复杂度$O(nlogn+mlo{g}^{2}n)$

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 100010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
struct PersistenceSegmentTree
{
    int root[maxn<<5], rtot, tot, L[maxn<<5], R[maxn<<5], ch[maxn<<5][2],
        llen[maxn<<5], rlen[maxn<<5], len[maxn<<5];
    int copy(int o)
    {
        tot++;
        L[tot]=L[o], R[tot]=R[o], ch[tot][0]=ch[o][0], ch[tot][1]=ch[o][1],
        llen[tot]=llen[o], rlen[tot]=rlen[o], len[tot]=len[o];
        return tot;
    }
    int New()
    {
        tot++;
        L[tot]=R[tot]=ch[tot][0]=ch[tot][1]=llen[tot]=rlen[tot]=len[tot]=0;
        return tot;
    }
    void build(int o, int l, int r)
    {
        int mid(l+r>>1);
        L[o]=l, R[o]=r;
        if(l==r)return;
        ch[o][0]=New(), ch[o][1]=New();
        build(ch[o][0],l,mid);
        build(ch[o][1],mid+1,r);
    }
    tuple<int,int,int> comb(int o1, int o2)
    {
        int a, b, c;
        if(llen[o1]==R[o1]-L[o1]+1)a=llen[o1]+llen[o2];
        else a=llen[o1];
        if(rlen[o2]==R[o2]-L[o2]+1)b=rlen[o1]+rlen[o2];
        else b=rlen[o2];
        c=max(len[o1],len[o2]), c=max(c,rlen[o1]+llen[o2]);
        return make_tuple(a,b,c);
    }
    void upd(int o)
    {
        auto t=comb(ch[o][0],ch[o][1]);
        llen[o]=get<0>(t);
        rlen[o]=get<1>(t);
        len[o]=get<2>(t);
    }
    void init(int l, int r)
    {
        rtot=0, tot=0;
        build(root[0]=New(),l,r);
    }
    int insert(int o, int pos)
    {
        int x=copy(o), mid=L[o]+R[o]>>1;
        if(L[o]==R[o]){llen[x]=rlen[x]=len[x]=1;return x;}
        if(pos<=mid)ch[x][0]=insert(ch[o][0],pos);
        else ch[x][1]=insert(ch[o][1],pos);
        upd(x);
        return x;
    }
    void ins(int pos)
    {
        root[rtot+1]=insert(root[rtot],pos);
        rtot++;
    }
    void q(int o, int l, int r, vector<int>& v)
    {
        int ans=0, mid=L[o]+R[o]>>1;
        if(l<=L[o] and r>=R[o]){v.emb(o);return;}
        if(l<=mid)q(ch[o][0],l,r,v);
        if(r>mid)q(ch[o][1],l,r,v);
    }
}segtree;
int getlen(int n, int l, int r)
{
    vector<int> v;
    segtree.q(segtree.root[n],l,r,v);
    int llen=0, rlen=0, len=0, Len=0;
    for(auto o:v)
    {
        len = max(len, segtree.len[o]);
        len = max(len, rlen+segtree.llen[o]);
        if(llen==Len)llen = llen+segtree.llen[o];
        if(segtree.rlen[o] == segtree.R[o]-segtree.L[o]+1) rlen = rlen+segtree.rlen[o];
        else rlen = segtree.rlen[o];
        Len += segtree.R[o]-segtree.L[o]+1;
    }
    return len;
}
pii a[maxn];
int main()
{
    int n, q, L, R, mid, l, r, w, i;
    n=read();
    rep(i,n)a[i].first=read(), a[i].second=i;
    sort(a+1,a+n+1,greater<pii>());
    segtree.init(1,n);
    rep(i,n)segtree.ins(a[i].second);
    q=read();
    while(q--)
    {
        l=read(), r=read(), w=read();
        L=1, R=n;
        while(L<R)
        {
            mid=L+R>>1;
            if(getlen(mid,l,r)<w)L=mid+1;
            else R=mid;
        }
        printf("%d\n",a[L].first);
    }
    return 0;
}