Lightoj 1112 - Curious Robin Hood 【单点修改 + 单点、 区间查询】【树状数组 水题】
2015-08-17 16:52
441 查看
1112 - Curious Robin Hood
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 nsacks 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.
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 ithinteger
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).
题意:给你N个数和M次查询,查询分三种
一,1 i 表示查询i处的值,并把 i 处的值变为0。
二,2 i v 表示将 i 处 值增加 v。
三,3 x y 查询 区间[x, y]的值。
水题,直接用树状数组就可以了,没必要用线段树。
AC代码:注意下标是从0开始到N-1的
![]() | PDF (English) | Statistics | Forum |
Time Limit: 1 second(s) | Memory Limit: 64 MB |
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 ithinteger
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.题意:给你N个数和M次查询,查询分三种
一,1 i 表示查询i处的值,并把 i 处的值变为0。
二,2 i v 表示将 i 处 值增加 v。
三,3 x y 查询 区间[x, y]的值。
水题,直接用树状数组就可以了,没必要用线段树。
AC代码:注意下标是从0开始到N-1的
#include <cstdio> #include <cstring> #include <queue> #include <stack> #include <vector> #include <cmath> #include <cstdlib> #include <algorithm> #define MAXN 100000+10 #define MAXM 60000+10 #define INF 1000000 #define eps 1e-8 using namespace std; int N, M; int C[MAXN<<1]; int k = 1; int lowbit(int x) { return x & (-x); } int sum(int x) { int s = 0; while(x > 0) { s += C[x]; x -= lowbit(x); } return s; } void update(int x, int d) { while(x <= N) { C[x] += d; x += lowbit(x); } } void solve() { int x, y, d, op; printf("Case %d:\n", k++); while(M--) { scanf("%d", &op); if(op == 1) { scanf("%d", &x); x++; printf("%d\n", sum(x) - sum(x-1)); int t = sum(x) - sum(x-1); update(x, -t); } else if(op == 2) { scanf("%d%d", &x, &d); x++; update(x, d); } else { scanf("%d%d", &x, &y); x++, y++; printf("%d\n", sum(y) - sum(x-1)); } } } int main() { int t; scanf("%d", &t); while(t--) { scanf("%d%d", &N, &M); memset(C, 0, sizeof(C)); int a; for(int i = 1; i <= N; i++) { scanf("%d", &a); update(i, a); } solve(); } return 0; }
相关文章推荐
- jQuery操作复选框的简单使用
- Linux-标准输入标准输出
- Android Studio 快捷键
- outFile.open("carinfo.txt");文档位置问题
- 修改unity新建脚本中默认模板的格式
- struts2 struts.xml文件<constant>标签说明
- hdu1863 畅通工程 并查集+最小生成树
- 提高tomcat的并发能力
- 【剑指offer】第一个字符只出现一次
- node.js中模块报错【window is not defined】的解决方法
- Tapestry5.3.8 创建和定制BeanModel控制Grid的操作
- oracle 外部表 external table
- Sql 锁的理解
- java中的map其实就是以键值对形式的存放数据的容器,其常用的实现类主要是哈希map
- 二维指针和二维数组
- Maven3路程(三)用Maven创建第一个web项目(1)
- Eclipse 安装插件 几乎就这么几个步骤,包括svn安装
- BZOJ 1060 [ZJOI2007]时态同步
- pywin32的安装
- Yii 2.0排序功能的使用