Apple Tree - POJ 3321 树状数组+离散化+N叉树

Apple Tree

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 17962		Accepted: 5450

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

题意：先给你每次节点的连接方式，一开始每个节点上都有苹果，然后问你某个节点及其子树一共有多少个苹果，期间某个节点的苹果可能会被摘下，或又长出来。

思路：dfs离散化，如果网上其他的题解看不懂是怎么建树的话，我这个方法应该比较容易懂。

          先说一下如何建树。

        比如                   1                 这棵树（对应一下），变成                    1

                     2            3          4                                                      2            5          9

                 5    6        7   8        9                                                 3    4        6   8        10

                                10                                                                              7 

         这样类似于先序的排列。

         然后比如问改后的5节点，就是5-8的和，1就是1-10的和。

         我是struct node { }其中的u和v代表父子连接方式然后按照u第一元素从小到大，v第二元素从小到大排序后放在数组里，这样方便记录某个节点下有哪些子节点。注意每个节点下可能有多个子节点……最开始因为这个WA了无数次。

AC代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{ int val,u,v,sonnum,begin,max;//val有无苹果,uv父子节点，sonnum子节点数量，
                               //begin,num2[]中从哪个开始时它的连接方式
                               //max记录某个点下面最大的子节点是多少，用于树状数组求和
}tree[100010];   //tree[]一做两用，排序uv和记录某个节点下有哪些子节点
int a[100010];
int num1[100010];
int num2[100010];
int n,m,pos,u,v;
char s[10];
int lowbit(int x)
{ return x&(-x);
}
void update(int x,int val)
{ while(x<=100000)
  { a[x]+=val;
    x+=lowbit(x);
  }
}
int sum(int x)
{ int ret=0;
  while(x)
  { ret+=a[x];
    x-=lowbit(x);
  }
  return ret;
}
bool cmp(node a,node b)
{ if(a.u<b.u)
   return true;
  else if(a.u==b.u)
    return a.v<b.v;
  else
    return false;
}
void dfs(int k)
{ num1[k]=++pos;
  for(int i=tree[k].begin;i<tree[k].begin+tree[k].sonnum;i++)//从左到右dfs
   dfs(num2[i]);
  tree[k].max=pos;//记录某个点下面最大的子节点是多少，用于树状数组求和
}
int main()
{ int k,i,j,father,ans=0,num;
   scanf("%d",&n);
  for(i=1;i<=n;i++)
  { update(i,1);tree[i].val=1;}
  for(i=1;i<n;i++)
   scanf("%d%d",&tree[i].u,&tree[i].v);
  sort(tree+1,tree+n,cmp);
  father=1;
  tree[1].begin=1;
  for(i=1;i<n;i++)
  { if(tree[i].u==father)
    { tree[father].sonnum++;
      num2[i]=tree[i].v;
    }
    else
    { father=tree[i].u;
      tree[father].begin=i;
      tree[father].sonnum++;
      num2[i]=tree[i].v;
    }
  }
  pos=0;
  dfs(1);
  scanf("%d",&m);
  for(j=1;j<=m;j++)
  { scanf("%s",s);
    scanf("%d",&k);
    if(s[0]=='Q')
    { ans=sum(tree[k].max)-sum(num1[k])+tree[k].val;
      printf("%d\n",ans);
    }
    else
    { if(num1[k]!=0)
      if(tree[k].val==1)
      { update(num1[k],-1);
        tree[k].val=0;
      }
      else
      { update(num1[k],1);
        tree[k].val=1;
      }
    }
  }
}