Counting Offspring（hdu 3887dfs+树状数组）

You are given a tree, it’s root is p, and the node is numbered from 1 to n. Now define f(i) as the number of nodes whose number is less than i in all the succeeding nodes of node i. Now we need to calculate f(i) for any possible i.
Input
Multiple cases (no more than 10), for each case:
The first line contains two integers n (0<n<=10^5) and p, representing this tree has n nodes, its root is p.
Following n-1 lines, each line has two integers, representing an edge in this tree.
The input terminates with two zeros.
Output
For each test case, output n integer in one line representing f(1), f(2) … f(n), separated by a space.
Sample Input
15 7
7 10
7 1
7 9
7 3
7 4
10 14
14 2
14 13
9 11
9 6
6 5
6 8
3 15
3 12
0 0
Sample Output
0 0 0 0 0 1 6 0 3 1 0 0 0 2 0
f(i) 代表着i的子树中节点编号比i小的节点个数。
对于树上操作来说，dfs是少不了的，那么我们怎么在dfs的过程中去找到这个f（i）呢？显然可以用树状数组来实现这个功能。在进入一个子树之前，我们可以统计在这之前该节点之前的节点有多少已经被统计了，出了这个子树以后我们在统计一遍，做个差。这样就是它的子树中节点编号小于该节点的数目。
代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#define ll long long
using namespace std;

const int maxx=1e5+100;
int head[maxx*2],sum[maxx],c[maxx*2];
int vis[maxx];
struct edge{
	int to;
	int next;
}e[maxx*2];
int n,root,tot,sign;

void init()
{
	tot=sign=0;
	memset(head,-1,sizeof(head));
	memset(sum,0,sizeof(sum));
}
void addedge(int u,int v)
{
	e[tot].to=v,e[tot].next=head[u],head[u]=tot++;
}
int lowbit(int x){return x&-x;}
void add(int cur,int w)
{
	while(cur<2*maxx)
	{
		c[cur]+=w;
		cur+=lowbit(cur);
	}
}
int query(int cur)
{
	int ans=0;
	while(cur)
	{
		ans+=c[cur];
		cur-=lowbit(cur);
	}
	return ans;
}
void dfs(int u,int f)
{
	sum[u]=query(u-1);
	for(int i=head[u];i!=-1;i=e[i].next)
	{
		int to=e[i].to;
		if(to==f) continue;
		add(to,1);
		dfs(to,u);
	}
	sum[u]=query(u-1)-sum[u];
}
int main()
{
	while(scanf("%d%d",&n,&root),n||root)
	{
		init();
		int x,y;
		for(int i=1;i<n;i++)
		{
			scanf("%d%d",&x,&y);
			addedge(x,y);
			addedge(y,x);
		}
		dfs(root,0);
		for(int i=1;i<=n;i++) printf("%d%s",sum[i],i==n?"\n":" ");
	}
}

努力加油a啊，(^o)/~