poj 3468 A Simple Problem with Integers

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.

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.

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

#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std; 
#define MAX_N 100001  

__int64 sum = 0;  
__int64 num[MAX_N];  

struct node  
{  
    int left;  
    int right;  
    __int64 count; //表示该节点的总个数  
    __int64 data;  //表示增量的那个数  
}N[4*MAX_N];  


void CreateTree(int i,int a,int b)  
{  
    N[i].left = a;  
    N[i].right = b;  
    N[i].data = 0;  
    if(a == b)  
    {  
        N[i].count= num[a];
		return ;
    }  
	int mid = (a+b)/2;  
	CreateTree(i*2,a,mid);  
	CreateTree(i*2+1,mid+1,b);  
	N[i].count= N[i*2].count+ N[i*2+1].count;  
}  

void insert(int i,int a,int b,int c)  
{  
    if(N[i].left == a && N[i].right == b)  
    {  
        N[i].data += c; 
	      return ;
    }  
    
	
	int mid = (N[i].left + N[i].right) /2;  
	if(b <= mid)  
		insert(i*2,a,b,c);  
	else if(a > mid)  
		insert(i*2+1,a,b,c);  
	else  
	{  
		insert(i*2,a,mid,c);  
		insert(i*2+1,mid+1,b,c);  
	}  
	N[i].count = (N[i*2].count + (N[i*2].right - N[i*2].left + 1) * N[i*2].data)+(N[i*2+1].count + (N[i*2+1].right - N[i*2+1].left + 1) * N[i*2+1].data);  
	
}  

void find(int i,int a,int b)  
{  
    if(N[i].left == a && N[i].right == b)  
    {  
        sum+= N[i].count + N[i].data*(b-a+1);
	      return ;
    }  

	N[i*2].data += N[i].data;  
	N[i*2+1].data += N[i].data;  
	N[i].count += N[i].data * (N[i].right - N[i].left + 1);  
	N[i].data = 0; 

	int mid = (N[i].left + N[i].right)/2;  
	if(b <= mid)  
		find(i*2,a,b);  
	else if(a > mid)  
		find(i*2+1,a,b);  
	else  
	{  
		find(i*2,a,mid);  
		find(i*2+1,mid+1,b);  
	}  
     
}  

int main()  
{  
    int n,m,x1,x2,x3;  
    char c;  
    int i;  
    while(scanf("%d%d",&n,&m)!=EOF)  
    {  
        for(i=1;i<=n;i++)  
            scanf("%I64d",&num[i]);  
        CreateTree(1,1,n);  
		
        while(m--)  
        {  
            scanf("%*c%c",&c);  
            if(c == 'Q')  
            {  
                sum = 0;  
                scanf("%d%d",&x1,&x2);  
                find(1,x1,x2);  
                printf("%I64d\n",sum);  
            }  
            else   
            {  
                scanf("%d%d%d",&x1,&x2,&x3);  
                insert(1,x1,x2,x3);  
            }  
        }  
    }  
	return 0;
}  

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int max(int a,int b)
{
    return (a>b?a:b);
}
int a[200000];
struct Node
{
    int left,right;
    int t;
}node[4*200000];

void MakeTree(int l,int r,int i)
{
  node[i].left=l;
  node[i].right=r;

   if(l==r)
   {
       node[i].t=a[l];
       return ;
   }
  int mid=(l+r)/2;
  MakeTree(l,mid,2*i);
  MakeTree(mid+1,r,2*i+1);
  node[i].t=node[2*i].t+node[2*i+1].t;
}

void UpdateTree(int i,int x,int k)
{
    int l=node[i].left;
    int r=node[i].right;
    int mid=(l+r)/2;
    if(x==l&&x==r)
    {
        node[i].t+=k;
        return ;
    }
    if(x>mid)
        UpdateTree(2*i+1,x,k);
    else
        UpdateTree(2*i,x,k);

    node[i].t=node[2*i].t+node[2*i+1].t;

}

int QueryTree(int x,int y,int i)
{
    if(node[i].left==x && node[i].right==y)
        return node[i].t;
    int m=(node[i].left+node[i].right)/2;

    if(x>m)
        return QueryTree(x,y,2*i+1);
    else if(y<=m)
        return QueryTree(x,y,2*i);
    else
        return QueryTree(x,m,2*i)+QueryTree(m+1,y,2*i+1);
}

int main ()
{
    int T,n,m;
    int i,j,x,y,k;
    char c[10];
    while(~scanf("%d%d",&n,&m))
    {

        for(i=1;i<=n;i++)
            scanf("%d",&a[i]);

        MakeTree(1,n,1);
        for(j=1;j<=m;j++)
        {
         scanf("%s%d%d",c,&x,&y);
         if(c[0]=='C')
         {
             scanf("%d",&k);
             for(i=x;i<=y;i++)
             {
                 UpdateTree(1,i,k);
             }
         }
         else
            cout<<QueryTree(x,y,1)<<endl;
       }
    }
    return 0;
}