链接
题目描述
给定一数列,规定有两种操作,一是修改某个元素,二是求区间的连续和。
样例输入
10 20
0 1 10
1 1 4
0 6 6
1 4 10
1 8 9
1 4 9
0 10 2
1 1 8
0 2 10
1 3 9
0 7 8
0 3 10
0 1 1
1 3 8
1 6 9
0 5 5
1 1 8
0 4 2
1 2 8
0 1 1
样例输出
10
6
0
6
16
6
24
14
50
41
思路
裸的线段树,直接上
代码
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#define ll long long
using namespace std;
int n, m, k, a, b;
ll sum[400005];
void add(int k, int l, int r, int x, ll v)
{
if(l == r) {
sum[k] += v;
return;
}
int mid = (l + r) >> 1;
if(x <= mid) add(k * 2, l, mid, x, v);
else add(k * 2 + 1, mid + 1, r, x, v);
sum[k] = sum[k * 2] + sum[k * 2 + 1];
}
ll ask(int k, int L, int R, int l, int r)
{
if(L <= l && r <= R) return sum[k];
int mid = (l + r) / 2;
ll ans = 0;
if(L <= mid) ans += ask(k * 2, L, R, l, mid);
if(R > mid) ans += ask(k * 2 + 1, L, R, mid + 1, r);
return ans;
}
int main()
{
scanf("%d%d", &n, &m);
for(int i = 1; i <= m; ++i)
{
scanf("%d%d%d", &k ,&a, &b);
if(!k) add(1, 1, n, a, b);
else printf("%lld\n", ask(1, a, b, 1, n));
}
return 0;
}