樹狀數(shù)組 View Code #include<stdio.h>

#include<string.h>

#define lowbit( x ) ( x )&( -x )

int tree[50024],num,n;

void plus( int num,int x )

{

while( x <= n )

{

tree[x] += num;

x += lowbit( x );

}

}

int sum( int x )

{

int sum = 0;

while( x )

{

sum += tree[x];

x -= lowbit( x );

}

return sum;

}

int main( )

{

int t;

char str[100];

scanf( "%d",&t );

int k = t;

while( k-- )

{

memset( tree,0,sizeof( tree ) );

scanf( "%d",&n );

for( int i = 1; i <= n; ++i )

{

scanf( "%d",&num );

plus( num,i ); //第i個(gè)增加了NUM人

}

int r = 1;

while( scanf( "%s",str ),str[0] != 'E' )

{

int a,b;

scanf( "%d%d",&a,&b );

switch( str[0] )

{

case 'A':

plus( b,a );

break;

case 'S':

plus( -b,a );

break;

case 'Q':

if( r )

printf( "Case %d:\n",t - k );

r = 0;

printf("%d\n",sum( b ) - sum( a - 1 ));

break;

}

}

}

return 0;

}

轉(zhuǎn)載于:https://www.cnblogs.com/zuckerTT/archive/2011/09/24/2189804.html

總結(jié)

以上是生活随笔為你收集整理的【ds】HDU_1166的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。