传送门
题意
分析
主席树进行区间维护
我们维护每一个位置上的数字,上一次出现的位置在哪里,只要区间有数字的
l
a
s
t
last
last小于左端点即可,主席树暴力维护
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 5e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
struct Node{
int l,r;
int p;
int val;
}tr[N * 50];
int root[N],idx;
int a[N];
int last[N];
int n,m;
int build(int l,int r){
int p = ++idx;
tr[p].val = INF;
if(l == r) {
tr[p].p = l;
return p;
}
int mid = l + r >> 1;
tr[p].l = build(l,mid),tr[p].r = build(mid + 1,r);
if(tr[tr[p].l].val <= tr[tr[p].r].val) tr[p].val = tr[tr[p].l].val,tr[p].p = tr[tr[p].l].p;
else tr[p].val = tr[tr[p].r].val,tr[p].p = tr[tr[p].r].p;
return p;
}
int insert(int p,int l,int r,int x,int val){
int q = ++idx;
tr[q] = tr[p];
if(l == r){
tr[q].val = val;
return q;
}
int mid = l + r >> 1;
if(x <= mid) tr[q].l = insert(tr[q].l,l,mid,x,val);
else tr[q].r = insert(tr[q].r,mid + 1,r,x,val);
tr[q].val = min(tr[tr[q].l].val,tr[tr[q].r].val);
if(tr[tr[q].l].val <= tr[tr[q].r].val) tr[q].val = tr[tr[q].l].val,tr[q].p = tr[tr[q].l].p;
else tr[q].val = tr[tr[q].r].val,tr[q].p = tr[tr[q].r].p;
return q;
}
Node query(int p,int l,int r,int vl,int vr){
if(l >= vl && r <= vr) return tr[p];
int mid = l + r >> 1;
if(vr <= mid) return query(tr[p].l,l,mid,vl,vr);
else if(vl > mid) return query(tr[p].r,mid + 1,r,vl,vr);
Node t1 = query(tr[p].l,l,mid,vl,vr),t2 = query(tr[p].r,mid + 1,r,vl,vr);
if(t1.val < t2.val) return t1;
return t2;
}
int main() {
read(n);
for(int i = 1;i <= n;i++) read(a[i]);
root[0] = build(1,n);
for(int i = 1;i <= n;i++){
if(!last[a[i]]) root[i] = insert(root[i - 1],1,n,i,0);
else{
root[i] = insert(root[i - 1],1,n,last[a[i]],INF);
root[i] = insert(root[i],1,n,i,last[a[i]]);
}
last[a[i]] = i;
}
read(m);
while(m--){
int l,r;
read(l),read(r);
Node t = query(root[r],1,n,l,r);
if(t.val >= l) puts("0");
else printf("%d\n",a[t.p]);
}
return 0;
}