练练主席树的入门题,kuangbin大佬的板子里的例题。。。。感觉用莫队写会更好写。主要是不大会写主席树
http://blog.csdn.net/aozil_yang/article/details/65448883
感觉这个讲的很清晰。
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 30010;
int n,q,tot;
int a[MAXN];
int T[MAXN];
int lson[MAXN*40],rson[MAXN*40],c[MAXN*40];
int build(int l, int r)
{
int root = tot++;
c[root] = 0;
if(l != r)
{
int mid = (l+r) >> 1;
lson[root] = build(l,mid);
rson[root] = build(mid+1,r);
}
return root;
}
int update(int root, int pos, int val)
{
int newroot = tot++,tmp = newroot;
c[newroot] = c[root] + val;
int l = 1,r = n;
while(l < r)
{
int mid = (l+r) >> 1;
if(pos <= mid)
{
lson[newroot] = tot++;
rson[newroot] = rson[root];
newroot = lson[newroot];
root = lson[root];
r = mid;
}
else
{
rson[newroot] = tot++;
lson[newroot] = lson[root];
newroot = rson[newroot];
root = rson[root];
l = mid+1;
}
c[newroot] = c[root] + val;
}
return tmp;
}
int query(int root, int pos)
{
int ret = 0;
int l = 1, r = n;
while(pos < r)
{
int mid = (l+r) >> 1;
if(pos <= mid)
{
r = mid;
root = lson[root];
}
else
{
ret += c[lson[root]];
root = rson[root];
l = mid+1;
}
}
return ret+c[root];
}
int main()
{
while(scanf("%d",&n) != EOF)
{
tot = 0;
for(int i = 1; i <= n; ++i)
scanf("%d",&a[i]);
T[n+1] = build(1,n);
map<int,int> mp;
for(int i = n; i >= 1; --i)
{
if(mp.find(a[i]) == mp.end())
T[i] = update(T[i+1],i,1);
else
{
int tmp = update(T[i+1],mp[a[i]],-1);
T[i] = update(tmp,i,1);
}
mp[a[i]] = i;
}
scanf("%d",&q);
int l,r;
while(q--)
{
scanf("%d %d",&l,&r);
printf("%d\n",query(T[l],r));
}
}
return 0;
}
参考:http://www.cnblogs.com/jianrenfang/p/6372294.html
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 30010;
int n,m,cnt,root[MAXN],a[MAXN],x,y,k;
int lastPos[MAXN];
struct node
{
int l,r,sum;
} T[MAXN*40];
vector<int> vec;
int getid(int x)
{
return lower_bound(vec.begin(),vec.end(),x)-vec.begin()+1;
}
void update(int l, int r, int &x, int y, int pos, int val)
{
T[++cnt] = T[y];
T[cnt].sum += val;
x = cnt;
if(l == r) return;
int mid = (l+r) >> 1;
if(pos <= mid)
update(l,mid,T[x].l,T[y].l,pos,val);
else
update(mid+1,r,T[x].r,T[y].r,pos,val);
}
int query(int l, int r, int x, int y, int pl, int pr)
{
if(pl <= l && pr >= r)
return T[y].sum - T[x].sum;
else
{
int mid = (l+r) >> 1;
if(pr <= mid)
return query(l,mid,T[x].l,T[y].l,pl,pr);
else if(pl > mid)
return query(mid+1,r,T[x].r,T[y].r,pl,pr);
else
return query(l,mid,T[x].l,T[y].l,pl,pr) + query(mid+1,r,T[x].r,T[y].r,pl,pr);
}
}
void init()
{
memset(lastPos,0,sizeof(lastPos));
memset(root,0,sizeof(root));
vec.clear();
cnt = 0;
T[0].l = T[0].r = T[0].sum = 0;
}
int main()
{
while(scanf("%d",&n) != EOF)
{
init();
for(int i = 1; i <= n; ++i)
{
scanf("%d",&a[i]);
vec.push_back(a[i]);
}
sort(vec.begin(),vec.end());
vec.erase(unique(vec.begin(),vec.end()),vec.end());
int tempRoot = 0;
for(int i = 1; i <= n; ++i)
{
a[i] = getid(a[i]);
if(!lastPos[a[i]])
{
update(1,n,root[i],root[i-1],i,1);
lastPos[a[i]] = i;
}
else
{
update(1,n,tempRoot,root[i-1],lastPos[a[i]],-1);
update(1,n,root[i],tempRoot,i,1);
lastPos[a[i]] = i;
}
}
int l,r,q;
scanf("%d",&q);
while(q--)
{
scanf("%d %d",&l,&r);
printf("%d\n",query(1,n,root[l-1],root[r],l,r));
}
}
return 0;
}