Color the ball
Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5970 Accepted Submission(s): 3166
當N = 0,輸入結束。
#include <iostream>
using namespace std;
#define maxn 100000
#define lson l,m,rt*2
#define rson m+1,r,rt*2+1
int sum[maxn<<2];
int col[maxn<<2];
void build(int l,int r,int rt)
{
sum[rt]=0;
col[rt]=0;
if(l==r)
return;
int m=(r+l)/2;
build(l,m,rt*2);
build(m+1,r,rt*2+1);
sum[rt]=sum[rt*2]+sum[rt*2+1];
}
void PushDown(int rt,int m)
{
if (col[rt])
{
col[rt<<1] +=col[rt];
col[rt<<1|1] += col[rt];
sum[rt<<1] += (m - (m >> 1)) * col[rt];
sum[rt<<1|1] += (m >> 1) * col[rt];
col[rt] = 0;
}
}
void update(int L,int R,int c,int l,int r,int rt)
{
if (L <= l && r <= R)
{
col[rt] += c;
sum[rt] += c * (r - l + 1);
return ;
}
PushDown(rt , r - l + 1);
int m = (l + r) >> 1;
if (L <= m) update(L , R , c ,l,m,rt*2);
if (m < R) update(L , R , c , m+1,r,rt*2+1);
sum[rt]=sum[rt*2]+sum[rt*2+1];
}
int query(int L,int R,int l,int r,int rt)
{
if (L <= l && r <= R)
{
return sum[rt];
}
PushDown(rt , r - l + 1);
int m = (l + r) >> 1;
int ret = 0;
if (L <= m) ret += query(L , R , l,m,rt*2);
if (m < R) ret += query(L , R ,m+1,r,rt*2+1);
return ret;
}
int main()
{
int t,i,n,a,b;
while(scanf("%d",&n)!=EOF)
{
if(n==0)
break;
t=n;
build(1,n,1);
while (t--)
{
scanf("%d%d",&a,&b);
update(a,b,1,1,n,1);
}
printf("%d",query(1,1,1,n,1));
for (i=2;i<=n;i++)
printf(" %d",query(i,i,1,n,1));
printf("\n");
}
return 0;
}
本題爲成段更新,我的方法沒優化,僅供參考!