hdu/hdoj 1166 敌兵布阵

最新推荐文章于 2018-08-21 16:29:19 发布

chen_kkkk

最新推荐文章于 2018-08-21 16:29:19 发布

阅读量618

点赞数

分类专栏：线段树文章标签： hdu 1166

本文链接：https://blog.csdn.net/chen_kkkk/article/details/10583115

版权

线段树专栏收录该内容

1 篇文章 0 订阅

订阅专栏

使用线段树或者树状数组

#include <iostream>
#include <stdio.h>
using namespace std;

const int MAX = 50000;

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

int com[ MAX + 1 ],N,T;

void modify ( int pos, int val ){

     while ( pos <= N ){

            com[pos] += val;

            pos = pos + lowbit(pos);  

     } 

}

int quy ( int x ){

    int sum = 0;

    while ( x > 0 ){

           sum = sum + com[x];

           x = x - lowbit(x);

    } 

    return sum;

}

int main ()

{

    while ( scanf ( "%d",&T ) != EOF ){

          int ca = 1,x,y;

          while ( T -- ){  

                 printf ( "Case %d:\n",ca++ );

                 scanf ( "%d",&N );

                 for ( int i = 0; i <= N; ++ i ) com[i] = 0;

                 for ( int i = 1; i <= N; ++ i ){

                       scanf ( "%d",&x );

                       modify ( i, x ); 

                 } 

                 char ask[10];

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

                        scanf ( "%d%d",&x,&y );

                        switch ( ask[0] ){

                                case 'A': modify ( x, y ); break;

                                case 'S': modify ( x, -y ); break;

                                case 'Q': printf ( "%d\n",quy ( y ) - quy ( x-1 ) ); break;

                        }

                 }

          } 

    }

    return 0;

}