【ds】HDU_1166

weixin_30602505

于 2019-07-17 06:37:20 发布

阅读量65

点赞数

原文链接：http://www.cnblogs.com/zuckerTT/archive/2011/09/24/2189804.html

版权

树状数组

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个增加了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;

}