poj 3468 A Simple Problem with Integers （线段树 segment tree）

                                                               A Simple Problem with Integers

Time Limit: 5000MS		Memory Limit: 131072K
Total Submissions: 20122		Accepted: 5316
Case Time Limit: 2000MS

Description

You have N integers, A₁, A₂, ... ,A_N. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in a given interval.

Input

The first line contains two numbers N and Q. 1 ≤ N,Q ≤ 100000.
The second line contains N numbers, the initial values of A₁,A₂, ... , A_N. -1000000000 ≤ A_i ≤ 1000000000.
Each of the next Q lines represents an operation.
"C a b c" means adding c to each of A_a, A_a+1, ... , A_b. -10000 ≤ c ≤ 10000.
"Q a b" means querying the sum of A_a, A_a+1, ... ,A_b.

Output

You need to answer all Q commands in order. One answer in a line.

Sample Input

10 5
1 2 3 4 5 6 7 8 9 10

Q 4 4

Q 1 10

Q 2 4

C 3 6 3

Q 2 4

Sample Output

4

55

9

15


在增加时，如果要加的区间正好覆盖一个节点，则增加其节点的Inc值，不再往下走，否则要更新nSum,再将增量往下传

在查询时，如果待查区间不是正好覆盖一个节点，就将节点的Inc往下带，然后将Inc代表的所有增量累加到nSum上后将Inc清0，接下来再往下查询。



利用线段树做

#include <iostream>

#include <stdio.h>

#include <stdlib.h>



using namespace std;

struct CNode

{

    int L , R;

    CNode * pLeft , * pRight;

    long long nSum;

    long long Inc;

};

CNode Tree[1000000];

int nCount = 0;



void BuildTree(CNode * pRoot , int L , int R)

{

     pRoot->L = L;

     pRoot->R = R;

     pRoot->nSum = 0;//初始化节点信息； 

     pRoot->Inc = 0;

     if(L == R) return ;

     

     nCount++;

     pRoot->pLeft = Tree + nCount;

     nCount++;

     pRoot->pRight = Tree + nCount;

     BuildTree( pRoot->pLeft , L , ( L + R ) / 2);

     BuildTree( pRoot->pRight , ( L + R ) / 2 + 1 , R);

}



void Insert(CNode * pRoot , int i ,int v)//将编号为 i 值为 v 的节点的插入到线段树中； 

{

     if( pRoot->L == i && pRoot->R == i)//找到该叶子节点

     {

         pRoot->nSum = v;

         return ;

     }

     pRoot->nSum += v;//该节点所在所有区间的 nSum 都要加上该节点的  v 值；

     if(i <= ( pRoot->L + pRoot->R ) / 2) 

     {//节点在左子树所表示的区间，则搜索左子树 

         Insert(pRoot->pLeft,i,v);

     } 

     else//否则搜索右子树 

     {

         Insert(pRoot->pRight , i , v);

     }

}



void Add(CNode * pRoot,int a , int b , long long c) //  将 区间  [a,b] 中 的元素都加上一个增量 c 

{

     if( pRoot->L == a && pRoot->R == b)//恰好找到区间 [a,b] 

     {

         pRoot->Inc += c;

         return ;

     }

     pRoot->nSum += c * (b - a + 1);//  当前节点区间覆盖了区间  [a,b]则调整该区间的 nSum 的值 

     if( b <= ( pRoot->L + pRoot->R ) / 2)//搜索区间在左子树 

          Add( pRoot->pLeft , a , b , c );

     else if( a >= ( pRoot->L + pRoot->R) / 2 + 1)//搜索区间被右子树覆盖 

          Add( pRoot->pRight ,a , b , c );

     else //搜索区间分别在左右子树，则调整搜索区间后分别搜索左右子树； 

     {

          Add(pRoot->pLeft , a , (pRoot->L + pRoot->R)/2 , c);

          Add(pRoot->pRight , (pRoot->L + pRoot->R) / 2 + 1 , b , c);

     }

}



long long QuerynSum( CNode * pRoot , int a , int b)

{

     if( pRoot->L == a && pRoot->R == b)//恰好找到搜索区间   

     {

         return pRoot->nSum + pRoot->Inc * (pRoot->R - pRoot->L + 1 );

     }

     

     pRoot->nSum += ( pRoot->R - pRoot->L + 1) * pRoot->Inc;

     Add( pRoot->pLeft , pRoot->L , (pRoot->L + pRoot->R) / 2 , pRoot->Inc);

     Add( pRoot->pRight , (pRoot->L + pRoot->R) / 2 + 1, pRoot->R , pRoot->Inc);

     pRoot->Inc  = 0;

     

     if( b <= ( pRoot->L + pRoot->R) / 2)//搜索左子树  

     {

         return QuerynSum( pRoot->pLeft , a , b);

     }

     else if( a >= ( pRoot->L + pRoot->R ) / 2 + 1)//搜索右子树 

     {

         return QuerynSum( pRoot->pRight , a , b);

     }

     else //分别搜索左右子树 

     {

         return QuerynSum( pRoot->pLeft , a , ( pRoot->L + pRoot->R ) / 2) + 

                QuerynSum( pRoot->pRight , ( pRoot->L + pRoot->R ) / 2 + 1 , b);

     }

}



int main()

{

    int n , q , a , b , c;

    char cmd[10];

    

    scanf("%d%d",&n,&q);

    int i , j , k;

    nCount = 0;

    BuildTree(Tree,1,n);

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

    {

        scanf("%d",&a);

        Insert(Tree,i,a);

    }

    for(int i = 0;i < q ; i++)

    {

        scanf("%s",cmd);

        if(cmd[0] == 'C')

        {

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

            Add( Tree , a , b , c );

        }

        else 

        {

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

            printf("%I64d/n",QuerynSum(Tree,a,b));

        }

    }

    return 0;

}