hdu1556

Color the ball

<pre name="code" class="cpp">#include"stdio.h"
#include"string.h"
#include"iostream"
#include"map"
#include"string"
#include"queue"
#include"stdlib.h"
#include"math.h"
#define M 100009
#define eps 1e-8
#define inf 1000000000
#define mod 1000000000
#define INF 1000000000
using namespace std;
struct st
{int l,r,sum,add,mark;
}a[M*4];
int ans;
void make(int l,int r,int k)
{a[k].l=l;a[k].r=r;a[k].mark=0;a[k].add=0;if(l==r){a[k].sum=0;return ;}int mid=(l+r)/2;make(l,mid,k*2);make(mid+1,r,k*2+1);a[k].sum=a[k*2].sum+a[k*2+1].sum;
}
void updata(int l,int r,int p,int k)
{if(a[k].l==l&&a[k].r==r){a[k].sum+=(r-l+1);a[k].add+=p;//当多次刚好更新还区间的时候，只更新到该区间，所以要连加a[k].mark=1;return;}if(a[k].mark){a[k*2].sum+=(a[k*2].r-a[k*2].l+1)*a[k].add;a[k*2].add+=a[k].add;a[k*2].mark=1;a[k*2+1].sum+=(a[k*2+1].r-a[k*2+1].l+1)*a[k].add;a[k*2+1].add+=a[k].add;a[k*2+1].mark=1;a[k].mark=0;a[k].add=0;//当向下延伸的时候，需要把当前区间赋为0，}int mid=(a[k].l+a[k].r)/2;if(r<=mid)updata(l,r,p,k*2);else if(l>mid)updata(l,r,p,k*2+1);else{updata(l,mid,p,k*2);updata(mid+1,r,p,k*2+1);}a[k].sum=a[k*2].sum+a[k*2+1].sum;
}
void query(int p,int k)
{if(a[k].l==p&&a[k].r==p){ans+=a[k].sum;return;}if(a[k].mark){a[k*2].sum+=(a[k*2].r-a[k*2].l+1)*a[k].add;a[k*2].add+=a[k].add;a[k*2].mark=1;a[k*2+1].sum+=(a[k*2+1].r-a[k*2+1].l+1)*a[k].add;a[k*2+1].add+=a[k].add;a[k*2+1].mark=1;a[k].mark=0;a[k].add=0;}int mid=(a[k].l+a[k].r)/2;if(p<=mid)query(p,k*2);elsequery(p,k*2+1);a[k].sum=a[k*2].sum+a[k*2+1].sum;
}
int main()
{int n,i;while(scanf("%d",&n),n){make(1,n,1);int x,y;for(i=1;i<=n;i++){scanf("%d%d",&x,&y);updata(x,y,1,1);}for(i=1;i<=n;i++){ans=0;query(i,1);if(i==1)printf("%d",ans);elseprintf(" %d",ans);}printf("\n");}return 0;
}