链接
https://vjudge.net/problem/UVA-12086
题解
树状数组裸题
用时十三分钟,太慢了
其实八分钟的时候就写完了,但是不停的
P
E
PE
PE就很尴尬
一定要看清要求啊
这题PE了两次
要是比赛这样估计被队友打死了
代码
#include <bits/stdc++.h>
#define maxn 200010
#define lowbit(x) (x&-x)
#define cl(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
ll r[maxn], bit[maxn], N;
void bitadd(ll pos, ll v)
{
for(;pos<=N;pos+=lowbit(pos))bit[pos]+=v;
}
ll bitsum(ll pos)
{
ll ans(0);
for(;pos;pos-=lowbit(pos))ans+=bit[pos];
return ans;
}
char s[10];
int main()
{
ll x, y, kase(0);
while(scanf("%lld",&N), N)
{
printf("Case %lld:\n",++kase);
cl(bit);
for(auto i=1;i<=N;i++)scanf("%lld",r+i), bitadd(i,r[i]);
while(scanf("%s",s), (s[0]!='E'))
{
scanf("%lld%lld",&x,&y);
if(s[0]=='S')
{
auto d=y-r[x];
r[x]=y;
bitadd(x,d);
}
else
{
printf("%lld\n",bitsum(y)-bitsum(x-1));
}
}
putchar(10);
}
return 0;
}