树状数组POJ3468

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<map>
#define up(i,a,b)  for(int i=a;i<b;i++)
#define dw(i,a,b)  for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
//#define local
typedef long long ll;
const double esp = 1e-6;
const double pi = acos(-1.0);
const long long INF = 0x3f3f3f3f;
using namespace std;
typedef pair<int, int> pir;
ll dir[100005];
ll dir2[100005];
ll a[100005];
ll summ[100005];
int n, q;
int lowbit(int i)
{
 return i & (-i);
}
ll sum(ll *array,int i)
{
 ll sum1 = 0;
 while (i>0)
 {
  sum1 += array[i];
  i -= lowbit(i);
 }
 return sum1;
}
void add(ll *array, int i,ll c)
{
 while (i <= n)
 {
  array[i] += c;
  i += lowbit(i);
 }
}
int main()
{
 cin >> n >> q;
 upd(i, 1, n)
 {
  scanf("%lld", &a[i]);
  summ[i] = summ[i - 1] + a[i];
 // cout << summ[i];
 }
 char s[2];
 int a, b, c;
 ll ans = 0;
 while (q--)
 {
  cin >> s;
  if (s[0] == 'Q')
  {
   cin >> a >> b;
   ans = summ[b] - summ[a - 1];
   ans += (b + 1)*sum(dir, b) - sum(dir2, b);
   ans -= (a)*sum(dir, a-1) - sum(dir2, a-1);
   cout << ans << endl;
  }
  else if (s[0] == 'C')
  {
   cin >> a >> b >> c;
   add(dir, b+1, -c);
   add(dir, a,c);
   add(dir2, b+1, -(b+1)*c);
   add(dir2, a, a*c);
  }
 }
 return 0;
}