用两个例子说明:
Link:http://acm.hdu.edu.cn/showproblem.php?pid=1698
1 10 2 1 5 2 5 9 3
Case 1: The total value of the hook is 24.
区间修改:
#include<iostream> #include<algorithm> #include<cmath> #include<cstring> #include<cstdio> #include<queue> #define MAXN 100010 #define LL long long using namespace std; struct node{ int l,r; LL tag;//存储懒惰记录的数值 (要改变的值) LL s; }tree[MAXN*4]; void build(int rt,int s,int e) { tree[rt].l=s; tree[rt].r=e; tree[rt].tag=0; if(s==e) { tree[rt].s=1; return;//记得return } int mid=(s+e)/2; build(rt*2,s,mid); build(rt*2+1,mid+1,e); tree[rt].s=tree[rt*2].s+tree[rt*2+1].s;//回溯 } void update(int rt,int ul,int ur,int val) { if(tree[rt].l==ul&&tree[rt].r==ur) { tree[rt].tag=val;//存储懒惰记录的数值 tree[rt].s=(ur-ul+1)*val; return;//记得return } int mid=(tree[rt].l+tree[rt].r)/2; if(tree[rt].tag!=0)//因为下面需要回溯,且每次更新的区间可能不同,即递归深搜的路径长度(树的遍历深度)不一样, //但回溯时路径总会有重合的部分,这样就会影响正确结果,故需要把该节点未更新的子区间也更新 { update(rt*2,tree[rt].l,mid,tree[rt].tag); update(rt*2+1,mid+1,tree[rt].r,tree[rt].tag); tree[rt].tag=0;//懒惰记录的数值传给下面子区间的节点了,故取消懒惰记录的数值 } if(mid>=ur) update(rt*2,ul,ur,val); else if(mid<ul) update(rt*2+1,ul,ur,val); else { update(rt*2,ul,mid,val); update(rt*2+1,mid+1,ur,val); } tree[rt].s=tree[rt*2].s+tree[rt*2+1].s;//回溯 } int main() { int t,x,y,z,cas,n,q; scanf("%d",&t); cas=0; while(t--) { cas++; scanf("%d",&n); build(1,1,n); scanf("%d",&q); while(q--) { scanf("%d%d%d",&x,&y,&z); update(1,x,y,z); } printf("Case %d: The total value of the hook is %lld.\n",cas,tree[1].s); } return 0; }
Link:http://poj.org/problem?id=3468
A Simple Problem with Integers
Description You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in a given interval. Input The first line contains two numbers N and Q. 1 ≤ N,Q ≤ 100000. Output You need to answer all Q commands in order. One answer in a line. Sample Input 10 5 1 2 3 4 5 6 7 8 9 10 Q 4 4 Q 1 10 Q 2 4 C 3 6 3 Q 2 4 Sample Output 4 55 9 15 Hint
The sums may exceed the range of 32-bit integers.
Source
POJ Monthly--2007.11.25, Yang Yi
|
区间增减:
#include<iostream> #include<algorithm> #include<cstring> #include<cmath> #include<queue> #include<cstdio> #define LL long long #define MAXN 100010 using namespace std; struct node{ int l,r; LL tag; LL sum; }tree[MAXN*4]; int a[MAXN]; void build(int rt,int l,int r) { tree[rt].l=l; tree[rt].r=r; tree[rt].tag=0; if(l==r) { tree[rt].sum=a[l]; return; } int mid=(l+r)/2; build(rt*2,l,mid); build(rt*2+1,mid+1,r); tree[rt].sum=tree[rt*2].sum+tree[rt*2+1].sum; } void update(int rt,int ul,int ur,LL v) { if(tree[rt].l==ul&&tree[rt].r==ur) { tree[rt].tag+=v; //tree[rt].sum+=v*(ur-ul+1); return; } tree[rt].sum+=v*(ur-ul+1); int mid=(tree[rt].l+tree[rt].r)/2; //因为不需要回溯, /*if(tree[rt].tag!=0) { update(rt*2,tree[rt].l,mid,tree[rt].tag); update(rt*2+1,mid+1,tree[rt].r,tree[rt].tag); tree[rt].tag=0; }*/ if(mid>=ur) update(rt*2,ul,ur,v); else if(mid<ul) update(rt*2+1,ul,ur,v); else { update(rt*2,ul,mid,v); update(rt*2+1,mid+1,ur,v); } //不需要回溯 } LL query(int rt,int l,int r) { if(tree[rt].l==l&&tree[rt].r==r) { return tree[rt].sum+(r-l+1)*tree[rt].tag; } tree[rt].sum+=(tree[rt].r-tree[rt].l+1)*tree[rt].tag; int mid=(tree[rt].l+tree[rt].r)/2; //update(rt*2,tree[rt].l,mid,tree[rt].tag); //update(rt*2+1,mid+1,tree[rt].r,tree[rt].tag); //tree[rt].tag=0; if(tree[rt].tag!=0)//因为下面需要回溯,且每次更新的区间可能不同,即递归深搜的路径长度(树的遍历深度)不一样, //但回溯时路径总会有重合的部分,这样就会影响正确结果,故需要把该节点未更新的子区间也更新 { update(rt*2,tree[rt].l,mid,tree[rt].tag); update(rt*2+1,mid+1,tree[rt].r,tree[rt].tag); tree[rt].tag=0;//懒惰记录的数值传给下面子区间的节点了,故取消懒惰记录的数值 } if(r<=mid) return query(rt*2,l,r); else if(l>mid) return query(rt*2+1,l,r); else{ return query(rt*2,l,mid)+query(rt*2+1,mid+1,r); } } int main() { int n,q,x,y,z,i; char ch; while(scanf("%d%d",&n,&q)!=EOF) { for(i=1;i<=n;i++) { scanf("%d",&a[i]); } build(1,1,n); while(q--) { cin>>ch; if(ch=='Q') { scanf("%d%d",&x,&y); printf("%lld\n",query(1,x,y)); } else { scanf("%d%d%d",&x,&y,&z); update(1,x,y,z); } } } return 0; }