线段树

#include<iostream>
using namespace std;
typedef long long ll;
const int maxn = 100000+10;

struct node
{
	ll sum,lazy;
};

int n,m;
int a[maxn];
node t[4*maxn];

void build(int x,int l,int r){
	if (l==r)
	{
		t[x].sum=a[l];
		return;
	}
	int mid=(l+r)>>1;
	build(2*x,l,mid);
	build(2*x+1,mid+1,r);
	t[x].sum=t[2*x].sum + t[2*x+1].sum;
}
void change(int x,int tl,int tr,int p,int k)
{
	if (tl==tr)
	{
		t[x].sum+=k;
		return;
	}
	int mid=(tl+tr)>>1;
	if(p<=mid) change(2*x,tl,mid,p,k);
	else change(2*x+1,mid+1,tr,p,k);
	t[x].sum=t[2*x].sum+t[2*x+1].sum;
}
void update(int x,int tl,int tr)
{
	t[x].sum=t[x].sum+(tr-tl+1)*t[x].lazy;
	if (tl!=tr)
	{
		t[2*x].lazy+=t[x].lazy;
		t[2*x+1].lazy+=t[x].lazy;
	}
	t[x].lazy=0;
}

ll ask(int x,int tl,int tr,int l,int r)
{	
	if(t[x].lazy) update(x,tl,tr);
	if (tl==l&&tr==r) return t[x].sum;
	int mid=(tl+tr)>>1;
	if (r<=mid) return ask(2*x,tl,mid,l,r);else
	if (l>mid) return ask(2*x+1,mid+1,tr,l,r);else
	{
		return ask(2*x,tl,mid,l,mid)+ask(2*x+1,mid+1,tr,mid+1,r);
	}
}

void change(int x,int tl,int tr,int l,int r,int k)
{
	if (tl==l&&tr==r)
	{
		t[x].lazy+=k;
		return;
	}
	if(t[x].lazy) update(x,tl,tr);
	int mid=(tl+tr)>>1;
	if(r<=mid) change(2*x,tl,mid,l,r,k);else
	if (l>mid) change(2*x+1,mid+1,tr,l,r,k);else
	{
		change(2*x,tl,mid,l,mid,k);
		change(2*x+1,mid+1,tr,mid+1,r,k);
	}
	t[x].sum=t[2*x].sum+(mid-tl+1)*t[2*x].lazy+t[2*x+1].sum+t[2*x+1].lazy*(tr-mid);
}
int main()
{	for (int i = 1; i <= 5; i++) a[i] = i ;
	build(1,1,5);
	//change(1,1,5,3,4);
	//cout << ask(1,1,5,1,4) << endl;
	cout <<"²Ù×÷Ç°£º"<<endl;
	for (int i = 1; i < 10; i++) cout << t[i].sum << " ";
	change(1,1,5,3,4,1);

	cout << endl; 
//	ask(1,1,5,1,2);¸üеײãµÄÖµÊÇÔÚÏ·ŲÙ×÷ÖнøÐÐµÄ 
//	for (int i = 1; i <= 5; i++) cout << a[i] << " ";
	cout <<"²Ù×÷ºó£º"<<endl;
	for (int i = 1; i < 10; i++) cout <<t[i].sum << " ";
	return 0;
}