Poj3321 Apple Tree【DFS序】【树状数组】
来源:互联网 发布:局域网监控软件 编辑:程序博客网 时间:2024/05/16 01:31
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
解题报告
这道题的题意就是这道题的意思。代码几乎一样。
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int N=100000;struct edge{ int v; int next;}ed[4*N+5];int head[N+5],num;int in[N+5],out[N+5],idc;int c[N+5],flag[N+5];int n,m;char ch[5];void build(int u,int v){ ed[++num].v=v; ed[num].next=head[u]; head[u]=num;}void dfs(int u,int f){ in[u]=++idc; for(int i=head[u];i!=-1;i=ed[i].next) { int v=ed[i].v; if(v==f)continue; dfs(v,u); } out[u]=idc;}int query(int pos){ int ret=0; for(int i=pos;i>=1;i-=i&(-i))ret+=c[i]; return ret;}int modify(int pos,int val){ for(int i=pos;i<=n;i+=i&(-i))c[i]+=val;}int main(){ memset(head,-1,sizeof(head)); scanf("%d",&n); for(int i=1;i<=n-1;i++) { int u,v; scanf("%d%d",&u,&v); build(u,v); build(v,u); } dfs(1,0); for(int i=1;i<=n;i++)modify(i,1); scanf("%d",&m); while(m--) { int pos; scanf("%s",ch); scanf("%d",&pos); if(ch[0]=='C') { flag[in[pos]]?modify(in[pos],1):modify(in[pos],-1); flag[in[pos]]^=1; } else printf("%d\n",query(out[pos])-query(in[pos]-1)); } return 0;}
- POJ3321 Apple Tree(DFS序 + 树状数组)
- poj3321-Apple Tree-dfs序+树状数组
- Poj3321 Apple Tree【DFS序】【树状数组】
- poj3321 Apple Tree(DFS+树状数组)
- 【POJ3321】Apple Tree-DFS+树状数组维护
- poj3321 Apple Tree(树状数组+dfs)
- 【树状数组--dfs序转化】poj3321 Apple Tree
- 【树状数组】 poj3321 Apple Tree
- POJ3321---Apple Tree(树状数组)
- POJ3321:Apple Tree(树状数组)
- POJ3321:Apple Tree(树状数组)
- POJ3321——Apple Tree(DFS+树状数组)
- POJ3321 Apple Tree(树状数组 + dfs + 线性表)
- 【poj3321】Apple Tree——树状数组&DFS
- (POJ3321)Apple Tree <dfs序列 树状数组>
- poj3321-dfs序&树状数组&dfs序模板题-Apple Tree
- poj3321——Apple Tree//树状数组
- Apple Tree(POJ3321)(树状数组)
- 基础代码-线段
- Linux面试题
- linux 系统之DNS高速缓存以及DDNS动态域名服务的配置
- 9.10
- 617. Merge Two Binary Trees
- Poj3321 Apple Tree【DFS序】【树状数组】
- 【MyBatis学习之宏观总结】
- ffplay播放视频出现segment fault问题分析和解决
- Android-monkey测试fd泄露
- 关于第7讲3D-2D实践程序中DMatch m:matches的理解
- 调整一组数据使得奇数位 位于偶数位的前面
- 练习题2
- CCF认证201503-2 数字排序
- day02-语言基础(2)