poj 3321 难度:一般
来源:互联网 发布:山下智久长泽雅美 知乎 编辑:程序博客网 时间:2024/05/29 03:35
点击打开链接
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
Sample Input
31 21 33Q 1C 2Q 1
Sample Output
32
题意:给你一颗苹果树,每个树杈有且只有一个苹果,注意不是二叉树是多叉树,Q: x表示x节点开始所有子树的苹果树之和,C:x表示如果x节点没有苹果,就加上一个苹果,如果右苹果,就减去一个苹果。
思路:看了别人的博客学会的 : 点击打开链接
先记录每个节点所涵盖子树的区间范围,接下来就是树状数组区间求和的问题了,注意这题vector有点坑,代码有注释。
#include<cstdio>#include<vector>using namespace std;int left[200001],right[200001];int c[200000];int flag[200001];int tot,n;vector<vector<int> >G(100001);//vector<int>这种会超时,要用上面这种 void dfs(int u){left[u]=tot;//记录该节点的子树左区间 for(int i=0;i<G[u].size();i++){tot++;dfs(G[u][i]);}right[u]=tot;//记录该节点的子树右区间 }void add(int i,int key){while(i<=n){c[i]+=key;i+=i&(-i);}}int sum(int i){int ans=0;while(i>0){ans+=c[i];i-=i&(-i);}return ans;}int main(){int m;while(~scanf("%d",&n)){int i,u,v,t;char ch[2];for(i=0;i<=n;i++){G[i].clear();flag[i]=c[i]=0;}for(i=1;i<n;i++){scanf("%d%d",&u,&v);G[u].push_back(v);}tot=1;dfs(1);//计算每个节点的子树区间范围 for(i=1;i<=n;i++)add(i,1);scanf("%d",&m);while(m--){scanf("%s",ch);if(ch[0]=='Q'){scanf("%d",&t);printf("%d\n",sum(right[t])-sum(left[t]-1));//子树右区间的和-左区间的和 }else{scanf("%d",&t);if(!flag[t]){flag[t]=1;add(left[t],-1);//从该节点的子树做区间开始更新 }else{flag[t]=0;add(left[t],1);}}}}}
- poj 3321 难度:一般
- poj 3928 难度:一般
- hdu 5700 难度:一般
- hdu 2795 难度:一般
- hdu--1455--DFS(难度一般)
- 百度Android笔试题(一般难度)
- poj 3321 Apple Tree(树状数组+dfs)中等难度
- hdu 5723 最小生成树+数学期望 难度:一般
- POJ 1047 没什么难度,注意读懂题。
- POJ 难度及题型题目分类
- poj 2771 有点难度最大独立集
- poj 1451 难度:中等 字典树+搜索
- poj 2891 一般模线性方程
- poj 2891 (一般模线性方程组)
- Codeforces 263 C. Circle of Numbers D. Cycle in Graph (dfs一般难度)
- 【二分图+最大匹配+有难度】poj 2226 Muddy Fields
- poj 百练 2765(基础题)有难度
- 【最长下降子序列+有难度】北大 poj 1836 Alignment
- 高级 JavaScript(一)
- jar包和war包的介绍和区别
- php 知识点参考
- Lock与synchronized 的区别
- linux 创建用户
- poj 3321 难度:一般
- 315-Count of Smaller Numbers After Self
- PAT 甲级 1006. Sign In and Sign Out (25)
- CSS3滚动条样式
- 在项目中使用gulp压缩css和js
- Java面试题全集(中)
- GetExitCodeThread
- 工业界怎样评估一个问题是否适合用NLP解决
- CSS3 常用选择器