标签:des style blog color java os io strong
1 10 1 2 3 4 5 6 7 8 9 10 Query 1 3 Add 3 6 Query 2 7 Sub 10 2 Add 6 3 Query 3 10 End
Case 1: 6 33 59
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int a[50001];
int n;
int lowbit(int t)
{
return t&(-t);
}
void Update(int t,int d) //第t个位置插入d
{
while(t<=n)
{
a[t]+=d;
t=t+lowbit(t);
}
}
__int64 getsum(int t) // 求区间[1,t]的和
{
__int64 sum=0;
while(t>0)
{
sum+=a[t];
t=t-lowbit(t);
}
return sum;
}
int main ()
{
int T,i,j;
int x,y;
char c[10];
scanf("%d",&T);
for(j=1;j<=T;j++)
{
printf("Case %d:\n",j);
scanf("%d",&n);
memset(a,0,sizeof(a));
int k;
for(i=1;i<=n;i++)
{
scanf("%d",&k);
Update(i,k);
}
while(~scanf("%s",c))
{
if(c[0]=='E') break;
scanf("%d%d",&x,&y);
if(c[0]=='A')
Update(x,y);
else if(c[0]=='S')
Update(x,-y);
else
printf("%I64d\n",getsum(y)-getsum(x-1)); //求区间[x,y]的和等于区间[1,y]的和 减 区间[1,(x-1)]的和
}
}
}
标签:des style blog color java os io strong
原文地址:http://blog.csdn.net/fyxz1314/article/details/38407287