线段树(区间修改,区间和):
#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
int c[1000000],n,m;
char s;
void update(int p,int l,int r,int x,int add)
{
int m=(l+r) / 2;
if (l==r)
{
c[p]+=add;
return;
}
if (x<=m) update(p*2,l,m,x,add);
if (x>m) update(p*2+1,m+1,r,x,add);
c[p]=c[p<<1]+c[p<<1|1];
}
int find(int p,int l,int r,int a,int b)
{
if (l==a && r==b) return c[p];
else
{
int m=(l+r) / 2;
if (b<=m) return find(p*2,l,m,a,b);
else if (a>m) return find(p*2+1,m+1,r,a,b);
else return find(p*2,l,m,a,m)+find(p*2+1,m+1,r,m+1,b);
}
}
int main()
{
scanf("%d",&n);
scanf("%d",&m);
for (int i=1;i<=m;i++)
{
cin>>s;
if (s=='M')
{
int x,y;
scanf("%d%d",&x,&y);
update(1,1,n,x,y);
}
if (s=='C')
{
int x,y;
scanf("%d%d",&x,&y);
printf("%d\n",find(1,1,n,x,y));
}
}
}
线段树(lazy):
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#define ll long long
using namespace std;
ll a[1000005],t[5000005],n,lazy[5000005],m;
ll read()
{
ll s=0;
char ch=getchar();
while (ch<'0' || ch>'9') ch=getchar();
while (ch>='0' && ch<='9')
{
s=(s << 1) + (s << 3) +ch-'0';ch=getchar();
}
return s;
}
void build(ll p,ll l,ll r)
{
if (l==r)
{
t[p]=a[l];
return;
}
ll m=(l+r)>>1;
build(p<<1,l,m);
build(p<<1|1,m+1,r);
t[p]=t[p<<1]+t[p<<1|1];
}
void pushdown(ll x,ll len)
{
if (lazy[x]!=0)
{
lazy[x<<1]+=lazy[