Problem:
RSQ and RAQ

Write a program which manipulates a sequence A = {a1, a2, . . . , an} with the following operations:

add(s, t, x): add x to as, as+1, ..., at.

getSum(s, t): report the sum of as, as+1, ..., at.

Note that the initial values of ai (i = 1, 2, . . . , n) are 0.

Input

n q
query1
query2
:
queryq

In the first line, n (the number of elements in A) and q (the number of queries) are given. Then, ith query queryi is given in the following format:

0 s t x

or

1 s t

The first digit represents the type of the query. '0' denotes add(s, t, x) and '1' denotes getSum(s, t).

Output

For each getSum operation, print the sum;

Constraints

1 ≤ n ≤ 100000

1 ≤ q ≤ 100000

1 ≤ s ≤ t ≤ n

0 ≤ x < 1000

Sample Input 1

3 5
0 1 2 1
0 2 3 2
0 3 3 3
1 1 2
1 2 3

Sample Output 1

4
8

Sample Input 2

4 3
1 1 4
0 1 4 1
1 1 4

Sample Output 2

0
4

Solution in C (judge verdict: Accepted)

#include<stdio.h>
long long N[400010],L[400010],T;
long long  hyouka(long long a,long long b){return a+b;}
void lsset(int n,int *d){
  int i;
  for(T=1;T<n;T*=2);
  for(i=0;i<T;i++)N[T+i]=i<n?d[i]:0;
  for(i=T-1;i;i--)N[i]=hyouka(N[i*2],N[i*2+1]);
}
void lasy(int i,int l,int r){
  if(L[i]==0)return;
  N[i]+=L[i]*(r-l);
  if(r-l>1){
    L[i*2  ]+=L[i];
    L[i*2+1]+=L[i];
  }
  L[i]=0;
}
void lsadd(int a,int b,int c,int i,int l,int r){//printf("%d %d %d\n",i,l,r);
  lasy(i,l,r);
  if(r<=a||b<=l)return;
  if(a<=l&&r<=b){
    L[i]+=c;
    lasy(i,l,r);
  }
  else{
    lsadd(a,b,c,i*2  ,l,(l+r)/2);
    lsadd(a,b,c,i*2+1,(l+r)/2,r);
    N[i]=hyouka(N[i*2],N[i*2+1]);
  }
}
long long lsget(int a,int b,int i,int l,int r){
  lasy(i,l,r);
  if(b<=l||r<=a)return 0;
  if(a<=l&&r<=b)return N[i];
  return hyouka(lsget(a,b,i*2,l,(l+r)/2),lsget(a,b,i*2+1,(l+r)/2,r));
}
int main(){
  int n,m,i,a,b,c,q,d[100010]={};
  scanf("%d %d",&n,&m);
  lsset(n,d);
  for(i=0;i<m;i++){
    scanf("%d %d %d",&q,&a,&b);
    if(q)printf("%lld\n",lsget(a-1,b,1,0,T));
    else{
      scanf("%d",&c);
      lsadd(a-1,b,c,1,0,T);
    }
  }
  return 0;
}