【树状数组--dfs序转化】poj3321 Apple Tree

Apple Tree

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 29822		Accepted: 8881

Description

There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.

The tree has N forks which are connected by branches. Kaka numbers the forks by 1 to N and the root is always numbered by 1. Apples will grow on the forks and two apple won't grow on the same fork. kaka wants to know how many apples are there in a sub-tree, for his study of the produce ability of the apple tree.

The trouble is that a new apple may grow on an empty fork some time and kaka may pick an apple from the tree for his dessert. Can you help kaka?

Input

The first line contains an integer N (N ≤ 100,000) , which is the number of the forks in the tree.
The following N - 1 lines each contain two integers u and v, which means fork u and fork v are connected by a branch.
The next line contains an integer M (M ≤ 100,000).
The following M lines each contain a message which is either
"C x" which means the existence of the apple on fork x has been changed. i.e. if there is an apple on the fork, then Kaka pick it; otherwise a new apple has grown on the empty fork.
or
"Q x" which means an inquiry for the number of apples in the sub-tree above the fork x, including the apple (if exists) on the fork x
Note the tree is full of apples at the beginning

Output

For every inquiry, output the correspond answer per line.

Sample Input

3
1 2
1 3
3
Q 1
C 2
Q 1

Sample Output

3
2

Source

POJ Monthly--2007.08.05, Huang, Jinsong

题意：一棵苹果树，每个树杈可以长一个苹果，kaka可以摘掉，苹果树也可以在空的树杈在长出一个；输入n表示有n个树杈，接下来n-1行，每行表示有u号树杈与v号树杈相连；有两种操作，一种是Q询问树杈x的子树总过有多少个苹果，另一种是C改变树杈x的苹果状态；

思路：先用dfs序变树结构为一个序列，然后操作序列求结果；关键是了解dfs序：点击打开链接

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;

const int maxn=110000;
int A[maxn],C[maxn],N,M;
int L[maxn],R[maxn],tot;

typedef vector<int> INT;  //不改成这样是会超时的，奇妙
vector<INT>E(maxn);

int lowbit(int k)
{
    return k&(-k);
}

void add(int x,int d)
{
    while(x<=N)
    {
        C[x]+=d;
        x+=lowbit(x);
    }
}

int sum(int x)
{
    int res=0;
    while(x>0)
    {
        res+=C[x];
        x-=lowbit(x);
    }
    return res;
}

void dfs(int x,int pre)                 //dfs序；
{
    L[x]=++tot;
    for(int i=0;i<(int)E[x].size();i++)
    {
        int y=E[x][i];
        if(y==pre) continue;
        dfs(y,x);
    }
    R[x]=tot;
}

int main()
{
    scanf("%d",&N);
    for(int i=1;i<N;i++)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        E[u].push_back(v);             //STL模拟邻接表；
    }

    for(int i=1;i<=N;i++)
    {
        A[i]=1;
        add(i,1);
    }
    dfs(1,0);                          

    scanf("%d",&M);
    while(M--)
    {
        char s[10];
        int num;
        scanf("%s",s);
        if(s[0]=='Q')
        {
            scanf("%d",&num);
            printf("%d\n",sum(R[num])-sum(L[num]-1));
        }
        else
        {
            scanf("%d",&num);
            if(A[L[num]])
            {
                A[L[num]]=0;
                add(L[num],-1);
            }
            else
            {
                A[L[num]]=1;
                add(L[num],1);
            }
        }
    }
    return 0;
}

dfs 序把树状结构便为一个序列，就可以很方便的使用树状数组解决问题了；

vector 模拟邻接表用时会比链表模拟链表长，本题一直TLE直到把vector<int>E[maxn]改成typedeg vector<int>INT ; vector<INT>E(maxn);

所以要学习一波链表模拟邻接表了~