luogu P4137 mex

题意：给定一个数列，查询一些区间的mex

思路：离线 ，询问排序，左端点向右移动，进行区间递推。

#include <bits/stdc++.h>
#define lc l,mid,x<<1
#define rc mid+1,r,x<<1|1
#define ls x<<1
#define rs x<<1|1
#define fi first
#define se second
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,int> piii;
const int inf = 0x3f3f3f3f;
const int maxn = 200005;
const int maxm = 200005;
const int maxq = 200005;
int a[maxn],last[maxn],ans[maxq];
vector<int> ve;
void discrete(){
    sort( ve.begin(),ve.end() );
    ve.erase( unique( ve.begin(),ve.end() ),ve.end() );
}
int H( int x ){
    int res = lower_bound( ve.begin(),ve.end(),x )-ve.begin();
    if( res >= ve.size() || ve[res] !=x ) return -1;
    else  return res;
}
int he[maxn],ver[maxm],ne[maxm],tot;
void add( int x,int y ){
    ver[++tot] = y;
    ne[tot] = he[x];
    he[x] = tot;
}
int b[maxn],vis[maxn],tree[4*maxn],laz[4*maxn];
void push_up( int x ){
    tree[x] = min( tree[ls],tree[rs] );
}
void push_down( int x ){
    if( laz[x] != inf ){
        laz[ls] =  min( laz[ls],laz[x] );
        laz[rs] = min( laz[rs],laz[x] );
        tree[ls] = min( tree[ls],laz[x] );
        tree[rs] = min( tree[rs],laz[x] );
        laz[x] = inf;
    }
}
void build( int l,int r,int x ){
    laz[x] = inf;
    if( l == r ){
        tree[x] = b[l];
        return;
    }
    int mid = l+r>>1;
    build(lc);
    build(rc);
    push_up(x);
}
void update( int left,int right,int v,int l,int r,int x ){
    if( left <= l && right >= r ){
        laz[x] = min( laz[x],v );
        tree[x] = min( tree[x],v );
        return;
    }
    push_down(x);
    int mid = l+r>>1;
    if( left <= mid )update(left,right,v,lc);
    if( right > mid )update( left,right,v,rc );
    push_up(x);
}
int query( int left,int right,int l,int r,int x ){
    if( left <= l && right >= r ){
        return tree[x];
    }
    push_down(x);
    int mid = l+r>>1;
    int res;
    if( left <= mid ) res= query( left,right,lc );
    else res= query( left,right,rc );
    push_up(x);
    return res;
}
vector<piii > v;
int main(){
    int n,m;scanf("%d%d",&n,&m);
    for( int i = 1;i <= n;i++ ){
        scanf("%d",&a[i]);
        ve.push_back( a[i] );
    }
    discrete();
    for( int i = 1;i <= n;i++ ){
        int x = H(a[i] );
        if( !last[x] ){
            last[x] = i;
        }else{
            add( last[x],i );
            last[x] = i;
        }
    }
    int cur = 0;
    for( int i = 1;i <= n;i++ ){
        vis[ H(a[i]) ] = 1;
        while( 1 ){
            int h = H(cur);
            if( h == -1 || vis[h] == 0 ) {
                b[i] = cur;break;
            }
            else cur++;
        }
    }
    build( 1,n,1 );
    int l,r;
    for( int i = 1;i <= m;i++ ){
        scanf("%d%d",&l,&r);
        v.push_back( piii(pii( l,r ),i) );
    }
    sort( v.begin(),v.end() );
    int last = 1;
    for( int i = 0;i < v.size();i++ ){
        l = v[i].fi.fi,r = v[i].fi.se;
        while( last < l ){
            int rr = he[last] ? ver[ he[last] ] : n+1;
            update( last,rr-1,a[last],1,n,1 );
            last++;
        }
        ans[ v[i].se ] = query( r,r,1,n,1 );
    }
    for( int i = 1;i <= m;i++ ){
        printf("%d\n",ans[i]);
    }
    return 0;
}