cf1000F. One Occurrence

链接

点击跳转

题解

对于每个位置，算出其后面和它相同的数字第一次出现在哪里，不妨称为$nex{t}_i$

然后离线，倒着枚举$l$，用线段树维护$nex{t}_i$的最大值

同一时刻每种权值只保留最左边的，如果查询得到的最大值大于$r$，那就找到了一个数字，否则就无解

代码

#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 1000010
#define maxe 1000010
#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
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 SegmentTree
{
    #define inf 0x3f3f3f3f
    int mn[maxn<<2], mx[maxn<<2], sum[maxn<<2], add[maxn<<2], set[maxn<<2], L[maxn<<2], R[maxn<<2];
    void maketag_set(int o, int v)
    {
        add[o]=0;
        set[o]=v;
        mx[o]=mn[o]=v;
        sum[o]=(R[o]-L[o]+1)*v;
    }
    void maketag_add(int o, int v)
    {
        add[o]+=v;
        mx[o]+=v, mn[o]+=v;
        sum[o]+=(R[o]-L[o]+1)*v;
    }
    void pushdown(int o)
    {
        if(L[o]==R[o])return;
        if(~set[o])
        {
            maketag_set(o<<1,set[o]);
            maketag_set(o<<1|1,set[o]);
            set[o]=-1;
        }
        if(add[o])
        {
            maketag_add(o<<1,add[o]);
            maketag_add(o<<1|1,add[o]);
            add[o]=0;
        }
    }
    void pushup(int o)
    {
        mx[o]=max(mx[o<<1],mx[o<<1|1]);
        mn[o]=min(mn[o<<1],mn[o<<1|1]);
        sum[o]=sum[o<<1]+sum[o<<1|1];
    }
    void build(int o, int l, int r, int* array)
    {
        int mid(l+r>>1);
        L[o]=l, R[o]=r;
        add[o]=0;
        set[o]=-1;
        if(l==r)
        {
            mn[o]=mx[o]=sum[o]=array[l];
            return;
        }
        build(o<<1,l,mid,array);
        build(o<<1|1,mid+1,r,array);
        pushup(o);
    }
    void segset(int o, int l, int r, int v)
    {
        int mid(L[o]+R[o]>>1);
        if(l<=L[o] and r>=R[o]){maketag_set(o,v);return;}
        pushdown(o);
        if(l<=mid)segset(o<<1,l,r,v);
        if(r>mid)segset(o<<1|1,l,r,v);
        pushup(o);
    }
    void segadd(int o, int l, int r, int v)
    {
        int mid(L[o]+R[o]>>1);
        if(l<=L[o] and r>=R[o]){maketag_add(o,v);return;}
        pushdown(o);
        if(l<=mid)segadd(o<<1,l,r,v);
        if(r>mid)segadd(o<<1|1,l,r,v);
        pushup(o);
    }
    int segsum(int o, int l, int r)
    {
        pushdown(o);
        int mid(L[o]+R[o]>>1), ans(0);
        if(l<=L[o] and r>=R[o])return sum[o];
        if(l<=mid)ans+=segsum(o<<1,l,r);
        if(r>mid)ans+=segsum(o<<1|1,l,r);
        return ans;
    }
    int segmin(int o, int l, int r)
    {
        int mid(L[o]+R[o]>>1), ans(inf);
        if(l<=L[o] and r>=R[o])return mn[o];
        pushdown(o);
        if(l<=mid)ans=min(ans,segmin(o<<1,l,r));
        if(r>mid)ans=min(ans,segmin(o<<1|1,l,r));
        return ans;
    }
    int segmax(int o, int l, int r)
    {
        int mid(L[o]+R[o]>>1), ans(-inf);
        if(l<=L[o] and r>=R[o])return mx[o];
        pushdown(o);
        if(l<=mid)ans=max(ans,segmax(o<<1,l,r));
        if(r>mid)ans=max(ans,segmax(o<<1|1,l,r));
        return ans;
    }
    #undef inf
}segtree;
int n, a[maxn], pos[maxn], nex[maxn], ans[maxn], l[maxn], r[maxn], b[maxn];
vector<int> qlis[maxn];
int main()
{
    int i, q;
    n=read();
    rep(i,n)a[i]=read();
    rep(i,500000)pos[i]=n+i;
    rep(i,500000)a[n+i]=i;
    for(i=n;i;i--)
    {
        nex[i]=pos[a[i]];
        pos[a[i]]=i;
    }
    rep(i,n)b[i]=-iinf;
    segtree.build(1,1,n,b);
    q=read();
    rep(i,q)l[i]=read(), r[i]=read(), qlis[l[i]].emb(i);
    for(i=n;i;i--)
    {
        if(nex[i]<=n)segtree.segset(1,nex[i],nex[i],-iinf);
        segtree.segset(1,i,i,nex[i]);
        for(auto q:qlis[i])
        {
            int p=segtree.segmax(1,i,r[q]);
            if(p>r[q])ans[q]=a[p];
        }
    }
    rep(i,q)printf("%d\n",ans[i]);
    return 0;
}