（线段树点更新区间求和）lightoj1112

链接：

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=88230#problem/D （密码0817）

Description

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 i^th sack to the poor, leaving the sack empty.

2) Add new amount (given in input) in the i^th sack.

3) Find the total amount of money from i^th sack to j^th 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 ≤ 10⁵) and q (1 ≤ q ≤ 50000). The next line contains n space separated integers in the range [0, 1000]. The i^th integer denotes the initial amount of money in the i^th 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 i^th(0 ≤ i < n) sack to the poor.

2 i v Add money v (1 ≤ v ≤ 1000) to the i^th(0 ≤ i < n) sack.

3 i j Find the total amount of money from i^th sack to j^th 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 i^th to j^th sack.

Sample Input

5 6

3 2 1 4 5

1 4

2 3 4

3 0 3

1 2

3 0 4

1 1

Sample Output

Case 1:

代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;#define Lson (r<<1)
#define Rson (r<<1|1)
#define Mid e[r].mid()const int N = 100005;struct node
{int L, R, sum;int mid(){return (L+R)/2;}
} e[N<<2];int a[N], sum;void BuildTree(int r, int L, int R)
{e[r].L = L , e[r].R = R;if(L==R){e[r].sum = a[L];return ;}BuildTree(Lson, L, Mid);BuildTree(Rson, Mid+1, R);e[r].sum = e[Lson].sum + e[Rson].sum;
}void Oper(int r, int i, int w)
{if(e[r].L == e[r].R){e[r].sum = w;return ;}if(i<=Mid)Oper(Lson, i, w);elseOper(Rson, i, w);e[r].sum = e[Lson].sum + e[Rson].sum;
}int Query(int r, int L, int R)
{if(e[r].L==L && e[r].R==R)return e[r].sum;if(R<=Mid)return Query(Lson, L, R);else if(L>Mid)return Query(Rson, L, R);else{int LL = Query(Lson, L, Mid);int RR = Query(Rson, Mid+1, R);return LL + RR;}}int main()
{int t, n, m, iCase=1;scanf("%d", &t);while(t--){int i, L, R, w, x;scanf("%d%d", &n, &m);for(i=1; i<=n; i++)scanf("%d", &a[i]);BuildTree(1, 1, n);printf("Case %d:\n", iCase++);while(m--){scanf("%d", &x);if(x==3){scanf("%d%d", &L, &R);sum = 0;L++, R++;printf("%d\n", Query(1, L, R));}else{scanf("%d", &i);i++;if(x==1){printf("%d\n", a[i]);a[i] = 0;}else{scanf("%d", &w);a[i] += w;}Oper(1, i, a[i]); ///由于都是点的操作，可以直接操做后在去操作树，感觉和直接操作树是一样的，不过对于///这题来说，这种似乎更好些， 因为有加和清零的，对点的操作是不一样的， 然而区间查询就很简单了，不说了}}}return 0;
}

转载于:https://www.cnblogs.com/YY56/p/4738471.html

（线段树点更新区间求和）lightoj1112相关推荐

HDU 1166 敌兵布阵(线段树:点更新,区间求和)
HDU 1166 敌兵布阵(线段树:点更新,区间求和) http://acm.hdu.edu.cn/showproblem.php?pid=1166 题意: 给你n个整数,然后给你多条命令,每条命令如 ...
hdu4417:线段树单点更新区间求和，离线 Super Mario
Description Mario is world-famous plumber. His "burly" figure and amazing jumping ability ...
hdu 1540（线段树单点更新区间合并）
解题思路:这一题要求的是连续区间,所以可以把它的子区间合并,这里运用线段树,但是在保存节点信息的方面要做一点修改 lsum:从这个区间的左端点往右能够找到的最大连续区间: rsum:从这个区间的右端点 ...
树链剖分+线段树单点修改区间求和模板
马上要去西安打邀请赛了,存下板子首先是vector存图的: #include<bits/stdc++.h> using namespace std; #define ll long lo ...
A - 卿学姐与公主(线段树+单点更新+区间极值)
A - 卿学姐与公主 Time Limit: 2000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submi ...
线段树2 求区间最小值
线段树2 求区间最小值递归,DFS,尤其是二叉树,我只要知道我的返回节点就好,因为DFS的顺序一定是一样的,不同的题目和数据范围也是一样的,只是返回节点让DFS的深度不同. 递归的内容只有两部分:1 ...
NYOJ 1068 ST（线段树之成段更新+区间求和）
ST 时间限制:1000 ms | 内存限制:65535 KB 难度:1 描述 "麻雀"lengdan用随机数生成了后台数据,但是笨笨的他被妹纸的问题给难住了... 已知len ...
数据结构之线段树进阶（区间更新lazy标记）
之前说了线段树的点更新和区间求和.其实点更新是区间更新的一种最基础的做法.我们把一个点想像成一个区间的话,不就是最简单的区间更新了嘛. 为什么要把区间更新和点更新分开来看呢?假如我们对区间[l,r]进 ...
poj 2892---Tunnel Warfare（线段树单点更新、区间合并）
题目链接 Description During the War of Resistance Against Japan, tunnel warfare was carried out extensiv ...

（线段树点更新区间求和）lightoj1112

（线段树点更新区间求和）lightoj1112相关推荐

最新文章

热门文章

（线段树 点更新 区间求和）lightoj1112

（线段树 点更新 区间求和）lightoj1112相关推荐

最新文章

热门文章

（线段树点更新区间求和）lightoj1112

（线段树点更新区间求和）lightoj1112相关推荐