MRaZY MRain is CraZY! This is old CodeBeta.

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
using namespace std;
typedef struct TSplayNode {
	int key, cover, size;
	__int64 data, sum;
	TSplayNode *lch, *rch, *pnt;
}*PSplayNode;
int n, q;
PSplayNode root;
 
void CoverExpand(PSplayNode cur) {
	if (cur->lch != NULL) {
		cur->lch->cover += cur->cover;
		cur->lch->data += cur->cover;
		cur->lch->sum += ((__int64)cur->cover) * cur->lch->size;
	}
	if (cur->rch != NULL) {
		cur->rch->cover += cur->cover;
		cur->rch->data += cur->cover;
		cur->rch->sum += ((__int64)cur->cover) * cur->rch->size;
	}
	cur->cover = 0;
}
 
void Update(PSplayNode cur) {
	cur->size = 1;
	if (cur->lch != NULL) cur->size += cur->lch->size;
	if (cur->rch != NULL) cur->size += cur->rch->size;
	if (cur->cover != 0) CoverExpand(cur);
	cur->sum = cur->data;
	if (cur->lch != NULL) cur->sum += cur->lch->sum;
	if (cur->rch != NULL) cur->sum += cur->rch->sum;
}
 
void LeftRotate(PSplayNode cur) {
	PSplayNode pnt = cur->pnt, anc = pnt->pnt;
	if (anc != NULL && anc->cover != 0) CoverExpand(anc);
	if (pnt->cover != 0) CoverExpand(pnt);
	if (cur->cover != 0) CoverExpand(cur);
	pnt->lch = cur->rch; if (cur->rch != NULL) cur->rch->pnt = pnt;
	cur->rch = pnt; pnt->pnt = cur;
	cur->pnt = anc;
	if (anc != NULL) {
		if (anc->lch == pnt) anc->lch = cur;
		else anc->rch = cur;
	}
	Update(pnt); Update(cur);
}
 
void RightRotate(PSplayNode cur) {
	PSplayNode pnt = cur->pnt, anc = pnt->pnt;
	if (anc != NULL && anc->cover != 0) CoverExpand(anc);
	if (pnt->cover != 0) CoverExpand(pnt);
	if (cur->cover != 0) CoverExpand(cur);
	pnt->rch = cur->lch; if (cur->lch != NULL) cur->lch->pnt = pnt;
	cur->lch = pnt; pnt->pnt = cur;
	cur->pnt = anc;
	if (anc != NULL) {
		if (anc->lch == pnt) anc->lch = cur;
		else anc->rch = cur;
	}
	Update(pnt); Update(cur);
}
 
void splay(PSplayNode cur) {
	PSplayNode pnt, anc;
	while (cur->pnt != NULL) {
		pnt = cur->pnt;
		anc = pnt->pnt;
		if (anc != NULL && anc->cover != 0) CoverExpand(anc);
		if (pnt->cover != 0) CoverExpand(pnt);
		if (cur->cover != 0) CoverExpand(cur);
		if (anc == NULL) {
			if (pnt->lch == cur) LeftRotate(cur);
			else RightRotate(cur);
		} else {
			if (pnt->lch == cur) LeftRotate(cur);
			else RightRotate(cur);
			if (anc->lch == cur) LeftRotate(cur);
			else RightRotate(cur);
		}
	}
	root = cur;
}
 
PSplayNode find(PSplayNode cur, int key) {
	while (cur->key != key) {
		if (cur->cover != 0) CoverExpand(cur);
		if (key < cur->key) {
			if (cur->lch == NULL) break;
			cur = cur->lch;
		}
		else if (key > cur->key) {
			if (cur->rch == NULL) break;
			cur = cur->rch;
		}
	}
	return cur;
}
 
void Insert(int key, int data) {
	PSplayNode cur = new(TSplayNode);
	memset(cur, 0, sizeof(TSplayNode));
	cur->key = key; cur->data = cur->sum = data; cur->size = 1;
	if (root == NULL) root = cur;
	else {
		splay(find(root, key));
		if (root->key < key) {
			cur->rch = root->rch;
			if (root->rch != NULL) root->rch->pnt = cur;
			root->rch = NULL; cur->lch = root;
		} else if (root->key > key) {
			cur->lch = root->lch;
			if (root->lch != NULL) root->lch->pnt = cur;
			root->lch = NULL; cur->rch = root;
		}
		root->pnt = cur;
		Update(root); Update(cur);
		root = cur;
	}
}
 
int main() {
	scanf("%d%d", &n, &q);
	root = NULL;
	Insert(0, 0);
	for (int i = 0; i < n; ++ i) {
		int a;
		scanf("%d", &a);
		Insert(i + 1, a);
	}
	Insert(n + 1, 0);
	scanf("\n");
	for (int i = 0; i < q; ++ i) {
		char c;
		int a, b, p;
		PSplayNode tmp;
		scanf("%c", &c);
		if (c == 'Q') {
			scanf("%d%d\n", &a, &b);
			splay(find(root, a - 1));
			tmp = root; root->rch->pnt = NULL;
			splay(find(root->rch, b + 1));
			cout << root->lch->sum << endl;
			root->pnt = tmp;
			tmp->rch = root;
			root = tmp;
		} else {
			scanf("%d%d%d\n", &a, &b, &p);
			splay(find(root, a - 1));
			tmp = root; root->rch->pnt = NULL;
			splay(find(root->rch, b + 1));
			root->lch->cover += p;
			root->lch->data += p;
			root->lch->sum += ((__int64)p) * root->lch->size;
			root->pnt = tmp;
			tmp->rch = root;
			root = tmp;
		}
	}
}