AC的故事大结局悲剧版（下） 主席树模板，区间修改

http://120.78.128.11/Problem.jsp?pid=2507

    现有m个操作，分三类：

    A：l 到r 营地在新的一天里新增士兵k名（随后时间从t 现在变成t+1了）

    B：问第i天 l 到r 营地共有士兵几名。

    C：时间倒流到x天 。（厉害了。。。）

/// .-~~~~~~~~~-._ _.-~~~~~~~~~-.
/// __.' ~. .~ `.__
/// .'// \./ \\`.
/// .'// | \\`.
/// .'// .-~"""""""~~~~-._ | _,-~~~~"""""""~-. \\`.
/// .'//.-" `-. | .-' "-.\\`.
/// .'//______.============-.. \ | / ..-============.______\\`.
/// .'______________________________\|/______________________________`.
#pragma GCC optimize(2)
#pragma comment(linker, "/STACK:102400000,102400000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
typedef long long LL;
typedef pair <int, int> ii;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e5+10;
const int maxx=1e3+10;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;

LL a[maxn];
char s[10];
struct chairmantree
{
int rt[40*maxn],ls[40*maxn],rs[40*maxn];
LL sum[maxn*40],lazy[40*maxn];
int tot;
void init()
{
tot=0;
}
void pushup(int l,int r,int pos)
{
sum[pos]=sum[ls[pos]]+sum[rs[pos]]+1LL*(r-l+1)*lazy[pos];
}
void buildtree(int l,int r,int &pos)
{
pos=++tot;
lazy[pos]=0;
sum[pos]=0;
if(l==r)
{
sum[pos]=a[l];
return ;
}
int mid=(l+r)>>1;
buildtree(l,mid,ls[pos]);
buildtree(mid+1,r,rs[pos]);
pushup(l,r,pos);
}
void update(int L,int R,ll c,int pre,int l,int r,int &pos)
{
pos=++tot;
ls[pos]=ls[pre];
rs[pos]=rs[pre];
sum[pos]=sum[pre];
lazy[pos]=lazy[pre];
if(L==l&&R==r)
{
sum[pos]+=1LL*(r-l+1)*c;
lazy[pos]+=c;
return ;
}
int mid=(l+r)>>1;
if(R<=mid)
update(L,R,c,ls[pre],l,mid,ls[pos]);
else
{
if(L>mid)
update(L,R,c,rs[pre],mid+1,r,rs[pos]);
else
{
update(L,mid,c,ls[pre],l,mid,ls[pos]);
update(mid+1,R,c,rs[pre],mid+1,r,rs[pos]);
}
}
pushup(l,r,pos);
}
LL query(int L,int R,int l,int r,int pos)
{
if(L==l&&R==r)
return sum[pos];
int mid=(l+r)>>1;
LL ans=1LL*lazy[pos]*(R-L+1);
if(R<=mid)
ans+=query(L,R,l,mid,ls[pos]);
else
{
if(L>mid)
ans+=query(L,R,mid+1,r,rs[pos]);
else
{
ans+=query(L,mid,l,mid,ls[pos]);
ans+=query(mid+1,R,mid+1,r,rs[pos]);
}
}
return ans;
}
} tree;

int cas=1;
int main()
{
int n,m;
while(scanf("%d",&n)!=EOF)
{
for(int i=1; i<=n; i++)
scanf("%lld",&a[i]);
tree.init();
scanf("%d",&m);
tree.buildtree(1,n,tree.rt[0]);
printf("Case %d:\n",cas++);
int now=0;
while(m--)
{
scanf("%s",s);
if(s[0]=='A')
{
int l,r;
ll c;
scanf("%d%d%lld",&l,&r,&c);
tree.update(l,r,c,tree.rt[now],1,n,tree.rt[now+1]);
now++;
}
// if(s[0]=='Q')
// {
// int l,r;
// scanf("%d %d",&l,&r);
// printf("%lld\n",tree.query(l,r,1,n,tree.rt[now]));
// }
if(s[0]=='B')
{
int l,r,t;
scanf("%d%d%d",&t,&l,&r);
printf("%lld\n",tree.query(l,r,1,n,tree.rt[t]));
}
if(s[0]=='C')
{
int x;
scanf("%d",&x);
now=x;
}
}
}
return 0;
}