Light oj 1112 - Curious Robin Hood【单点更新】
来源:互联网 发布:我知谁掌管明天 背景 编辑:程序博客网 时间:2024/05/01 22:05
Robin Hood likes to loot rich people since he helps the poor people with this money. Instead of keeping all the money together he does another trick. He keeps n sacks where he keeps this money. The sacks are numbered from 0 to n-1.
Now each time he can he can do one of the three tasks.
1) Give all the money of the ith sack to the poor, leaving the sack empty.
2) Add new amount (given in input) in the ith sack.
3) Find the total amount of money from ith sack to jth sack.
Since he is not a programmer, he seeks your help.
Input
Input starts with an integer T (≤ 5), denoting the number of test cases.
Each case contains two integers n (1 ≤ n ≤ 105) and q (1 ≤ q ≤ 50000). The next line contains n space separated integers in the range [0, 1000]. The ith integer denotes the initial amount of money in the ith sack (0 ≤ i < n).
Each of the next q lines contains a task in one of the following form:
1 i Give all the money of the ith (0 ≤ i < n) sack to the poor.
2 i v Add money v (1 ≤ v ≤ 1000) to the ith (0 ≤ i < n) sack.
3 i j Find the total amount of money from ith sack to jth sack (0 ≤ i ≤ j < n).
Output
For each test case, print the case number first. If the query type is 1, then print the amount of money given to the poor. If the query type is 3, print the total amount from ith to jth sack.
Sample Input
Output for Sample Input
1
5 6
3 2 1 4 5
1 4
2 3 4
3 0 3
1 2
3 0 4
1 1
Case 1:
5
14
1
13
2
Notes
Dataset is huge, use faster I/O methods.
给出一组数,进行题目给出的三种操作,输出需要的结果。
题解:
最基础的线段树题目,只需要单点更新和区间查询
很久没做线段树了,没想到还能 1 A....这是题目有多水....
/*http://blog.csdn.net/liuke19950717*/#include<cstdio>#include<cstring>#include<algorithm>using namespace std;typedef long long ll;const int maxn=1e5+5;int x[maxn],sumtree[maxn*4],kase=0;void build(int rt,int l,int r){if(l==r){sumtree[rt]=x[l];return;}int mid=(l+r)>>1,tp=rt<<1;build(tp,l,mid);build(tp|1,mid+1,r);sumtree[rt]=sumtree[tp]+sumtree[tp|1];}void update(int rt,int l,int r,int a,int b){if(l==r){sumtree[rt]=x[l]=b;return;}int mid=(l+r)>>1,tp=rt<<1;if(mid>=a){update(tp,l,mid,a,b);}else{update(tp|1,mid+1,r,a,b);}sumtree[rt]=sumtree[tp]+sumtree[tp|1];}int find(int rt,int l,int r,int a,int b){if(l>=a&&r<=b){return sumtree[rt];}int mid=(l+r)>>1,tp=rt<<1,ans=0;if(mid>=a){ans+=find(tp,l,mid,a,b);}if(mid<b){ans+=find(tp|1,mid+1,r,a,b);}return ans;}int main(){//freopen("shuju.txt","r",stdin);int t;scanf("%d",&t);while(t--){int n,m;memset(sumtree,0,sizeof(sumtree));scanf("%d%d",&n,&m);for(int i=1;i<=n;++i){scanf("%d",&x[i]);}build(1,1,n);printf("Case %d:\n",++kase);while(m--){int num;scanf("%d",&num);if(num==1){int a;scanf("%d",&a);printf("%d\n",x[a+1]);update(1,1,n,a+1,0);}else if(num==2){int a,b;scanf("%d%d",&a,&b);update(1,1,n,a+1,x[a+1]+b);}else{int a,b;scanf("%d%d",&a,&b);printf("%d\n",find(1,1,n,a+1,b+1));}}}return 0;}
- Light oj 1112 - Curious Robin Hood【单点更新】
- Light oj 1112 - Curious Robin Hood(树状数组)
- Light oj 1112-Curious Robin hood --树状数组
- 树状数组初步 Light OJ 1112 Curious Robin Hood
- LightOJ 1112 Curious Robin Hood
- Lightoj1112——Curious Robin Hood(线段树+单点更新)
- Lightoj 1112 - Curious Robin Hood 【单点修改 + 单点、 区间查询】【树状数组 水题】
- Curious Robin Hood
- LightOj 1112 Curious Robin Hood(线段树||树状数组)
- lightOj 1112 Curious Robin Hood (线段树)
- Curious Robin Hood(简单线段树)
- LightOJ1112——Curious Robin Hood
- LightOJ 1112 Curious Robin Hood && LightOJ 1266 Points in Rectangle(树状数组)
- light oj 1348 树链剖分(单点更新区间求值)
- CF_671B Robin Hood(二分)
- Light OJ 1080 - Binary Simulation - (线段树区间更新 单点查询)
- codefores 352 D. Robin Hood
- codeoforces 671B Robin Hood
- 算法分析—动态规划(01背包问题)
- 检查python模块是否安装
- 540 - Team Queue
- 设计模式之门面模式
- 1016
- Light oj 1112 - Curious Robin Hood【单点更新】
- 在web开发中ActionContext和ServletActionContext的比较
- 几种常见的集合
- 动态库的链接和链接选项-L,-rpath-link,-rpath
- 归并排序
- java中文乱码问题
- 【POJ 3070】Fibonacci(矩阵快速幂)
- iOS开发中数据库常用的语句
- [bzoj4569][SCOI2016]萌萌哒