树状数组

poj3321 apple tree

题意：有一颗01树，以结点1为树根，一开始所有的结点都是1，我们对他有两种操作：1. 把其中一个结点的值改变 （0变1，1变0） 2. 询问某个结点所带领的子树上的结点总和。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=100003;
struct kk{
	int to,ne;
}e[N<<1];
int in[N],out[N],cnt,tot,tr[N],h[N],i,x,n,m,y,v[N];
char c;
void addedge(int x,int y){
	e[++tot].to=y;
	e[tot].ne=h[x];
	h[x]=tot;
}
void dfs(int u){
	in[u]=++cnt;
	for (int i=h[u];i;i=e[i].ne){
		int v=e[i].to;
		if (!in[v]) dfs(v);
	}
	out[u]=cnt;
}
int query(int x){
	int s=0;
	for (;x;x-=x&-x) s+=tr[x];
	return s;
}
void add(int x,int y){
	for (;x<=n;x+=x&-x) tr[x]+=y;
}
int main(){
	scanf("%d",&n);
	for (i=1;i<n;i++){
		scanf("%d%d",&x,&y);
		addedge(x,y);
		addedge(y,x);
	}
	dfs(1);
	scanf("%d",&m);
	for (i=1;i<=n;i++) add(i,1);
	while (m--){
		do c=getchar();while (c!='Q' && c!='C');
		scanf("%d",&x);
		if (c=='Q') printf("%d\n",query(out[x])-query(in[x]-1));
		else{
			if (v[x]) add(in[x],1);
			else add(in[x],-1);
			v[x]^=1;
		}
	}
}

poj2182 Lost Cows

题意：有一列数，由1~n各一个所构成，现在给出这列数中，每一个数前面有几个数比该数小，请还原原序列。

#include<iostream>
#include<cstdio>
using namespace std;
const int N=8003;
int tr[N],num[N],i,n;
void add(int x,int y){
	for (;x<=n;x+=x&-x) tr[x]+=y;
}
int query(int x){
	int s=0;
	for (;x;x-=x&-x) s+=tr[x];
	return s;
}
int search(int x){
	int l=0,r=n;
	while (l<=r){
		int mid=l+r>>1;
		if (query(mid)<x) l=mid+1;
		else r=mid-1;
	}
	return l;
}
int main(){
	scanf("%d",&n);
	for (i=2;i<=n;i++) scanf("%d",&num[i]);
	for (i=1;i<=n;i++) add(i,1);
	for (i=n;i;i--){
		num[i]=search(num[i]+1);
		add(num[i],-1);
	}
	for (i=1;i<=n;i++) printf("%d\n",num[i]);
}

poj1990 MooFest

题意：有n头奶牛，每一头奶牛有一个联系系数v，所有的奶牛都站在同一直线上，我们给出每一头奶牛的坐标p，对于任意两头奶牛i,j，其联系花费是abs(pi-pj)*max(vi，vj)，现在我们要让任意两头奶牛都直接连接，求花费总值。

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=20003;
typedef long long ll;
struct node{
	ll v,x;
}a[N];
ll ans,t1,t2,tr[2][N];
int n,i;
bool cmp(node x,node y){
	return x.v<y.v || x.v==y.v && x.x<y.x;
}
ll query(int x,int y){
	ll s=0;
	for (;x;x-=x&-x) s+=tr[y][x];
	return s;
}
void add(int x,int y){
	for (;x<N;x+=x&-x) tr[0][x]++,tr[1][x]+=y;
}
int main(){
	scanf("%d",&n);
	for (i=1;i<=n;i++) scanf("%lld%lld",&a[i].v,&a[i].x);
	sort(a+1,a+n+1,cmp);
	for (i=1;i<=n;i++){
		t1=query(a[i].x-1,0);t2=query(a[i].x-1,1);
		ans+=(t1*a[i].x-t2)*a[i].v;
		t1=query(N-1,0)-query(a[i].x,0);
		t2=query(N-1,1)-query(a[i].x,1);
		ans+=(t2-t1*a[i].x)*a[i].v;
		add(a[i].x,a[i].x);
	}
	printf("%lld",ans);
}

hdu3874 Necklace

题意：询问区间去重后元素和

#include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
const int N=50003,M=200003;
struct kk{
    int l,r,id;
}b[M];
map<int,int>pre;
ll tr[N],ans[M];
int n,m,i,a[N],T,j;
bool cmp(kk x,kk y){
    return x.r<y.r || x.r==y.r && x.l<y.l;
}
void add(int x,int y){
    for (;x<=n;x+=x&-x) tr[x]+=y;
}
ll query(int x){
    ll s=0;
    for (;x;x-=x&-x) s+=tr[x];
    return s;
}
int main(){
    scanf("%d",&T);
    while (T--){
        pre.clear();
        memset(tr,0,sizeof(tr));
        scanf("%d",&n);
        for (i=1;i<=n;i++) scanf("%d",&a[i]);
        scanf("%d",&m);
        for (i=1;i<=m;i++) scanf("%d%d",&b[i].l,&b[i].r),b[i].id=i;
        sort(b+1,b+m+1,cmp);
        j=1;
        for (i=1;i<=n;i++){
            if (pre[a[i]]) add(pre[a[i]],-a[i]);
            add(i,a[i]);
            for (;j<=m && b[j].r==i;j++) ans[b[j].id]=query(b[j].r)-query(b[j].l-1);
            if (j>m) break;
            pre[a[i]]=i;
        }
        for (i=1;i<=m;i++) printf("%lld\n",ans[i]);
    }
}

hdu4417 Super Mario

题意：询问区间小于等于H的元素数量

#include<bits/stdc++.h>
using namespace std;
const int N=100002;
struct node{
    int l,r,id,x;
}q[N],a[N];
int T,n,m,cas,i,j,tr[N],ans[N];
void add(int x){
    for (;x<=n;x+=x&-x) tr[x]++;
}
int query(int x){
    int s=0;
    for (;x;x^=x&-x) s+=tr[x];
    return s;
}
bool cmp(node a,node b){return a.x<b.x;}
int main(){
    scanf("%d",&T);
    for (cas=1;cas<=T;cas++){
        scanf("%d%d",&n,&m);
        memset(tr,0,sizeof(tr));
        for (i=1;i<=n;i++) scanf("%d",&a[i].x),a[i].id=i;
        for (i=1;i<=m;i++) scanf("%d%d%d",&q[i].l,&q[i].r,&q[i].x),q[i].id=i;
        sort(a+1,a+n+1,cmp);
        sort(q+1,q+m+1,cmp);
        for (i=j=1;i<=m;i++){
            for (;j<=n && a[j].x<=q[i].x;j++) add(a[j].id);
            ans[q[i].id]=query(q[i].r+1)-query(q[i].l);
        }
        printf("Case %d:\n",cas);
        for (i=1;i<=m;i++) printf("%d\n",ans[i]);
    }
}