3468 A Simple Problem with Integers 线段树 求区间和 向区间添加值

A Simple Problem with Integers

Time Limit: 5000MS		Memory Limit: 131072K
Total Submissions: 12834		Accepted: 3113
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

Hint

The sums may exceed the range of 32-bit integers.

 

 

 

 

 

 

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n;//点数
struct node
{
    int left,right;
    long long sum,lnc;//lnc表示这个区间每个数都加上的一个值，sum表示和；但是实际的和是sum+lnc*（区间长度);
};
node tree[1000000];
void buildtree(int id,int l,int r)//建树
{
    tree[id].left=l;tree[id].right=r;//初始化
    tree[id].sum=0;tree[id].lnc=0;
    if(l!=r)
    {
        buildtree(2*id,l,(l+r)/2);//左子树
        buildtree(2*id+1,(l+r)/2+1,r);//右子树
    }
}
void insert(int id,int i,int val)//插入元素
{
    if(tree[id].left==i&&tree[id].right==i)//叶子节点
    {
        tree[id].sum=val;
        return ;
    }
    tree[id].sum+=val;//父亲节点要加上和
    if(i<=(tree[id].left+tree[id].right)/2)   insert(2*id,i,val);
    else insert(2*id+1,i,val);
}
void add(int id,int l,int r,long long val)
{
    if(tree[id].left==l&&tree[id].right==r)
    {
        tree[id].lnc+=val;//impotant  这个方法很是巧妙
        return ;
    }
    tree[id].sum+=val*(r-l+1);
    if(r<=(tree[id].left+tree[id].right)/2) add(2*id,l,r,val);
    else if(l>=(tree[id].left+tree[id].right)/2+1) add(2*id+1,l,r,val);
    else
    {
        add(2*id,l,(tree[id].left+tree[id].right)/2,val);
        add(2*id+1,(tree[id].left+tree[id].right)/2+1,r,val);
    }
}
long long query(int id,int l,int r)
{
    //恰好是某个区间的话，就直接返回lnc和sum就可以了   important
     if(tree[id].left==l&&tree[id].right==r)
    {
        return tree[id].sum+tree[id].lnc*(tree[id].right-tree[id].left+1);
    }
    //区间不恰好，要把lnc分下去，并且把sum加上lnc
    tree[id].sum+=tree[id].lnc*(tree[id].right-tree[id].left+1);//注意是加上整个区间
    long long val=tree[id].lnc;
    add(2*id,tree[id].left,(tree[id].left+tree[id].right)/2,val);
    add(2*id+1,(tree[id].left+tree[id].right)/2+1,tree[id].right,val);
    tree[id].lnc=0;//lnc重新置为0
    if(r<=(tree[id].left+tree[id].right)/2) return query(2*id,l,r);
    else if(l>=(tree[id].left+tree[id].right)/2+1) return query(2*id+1,l,r);
    else return query(2*id,l,(tree[id].left+tree[id].right)/2)+
    query(2*id+1,(tree[id].left+tree[id].right)/2+1,r);
}
int main()
{
    int ci;
    while(scanf("%d%d",&n,&ci)==2)
    {
        buildtree(1,1,n);//建树
        for(int i=1;i<=n;i++)
        {
            int x;
            scanf("%d",&x);
            insert(1,i,x);
        }
        while(ci--)
        {
            char ch;
            cin>>ch;
            if(ch=='C')
            {
                int l,r,val;
                scanf("%d%d%d",&l,&r,&val);
                add(1,l,r,val);//
            }
            else
            {
                int l,r;
                scanf("%d%d",&l,&r);
                printf("%I64d/n",query(1,l,r));
            }
        }
    }
    return 0;
}