HDU1166 敌兵布阵 splay

  1 // File Name: hdu1166.cpp
  2 // Author: darkdream
  3 // Created Time: 2015年04月02日 星期四 18时21分48秒
  4 
  5 #include<vector>
  6 #include<list>
  7 #include<map>
  8 #include<set>
  9 #include<deque>
 10 #include<stack>
 11 #include<bitset>
 12 #include<algorithm>
 13 #include<functional>
 14 #include<numeric>
 15 #include<utility>
 16 #include<sstream>
 17 #include<iostream>
 18 #include<iomanip>
 19 #include<cstdio>
 20 #include<cmath>
 21 #include<cstdlib>
 22 #include<cstring>
 23 #include<ctime>
 24 #define LL long long
 25 
 26 using namespace std;
 27 const int maxn = 50005;
 28 int t,n; 
 29 struct SplayTree{
 30     int sz[maxn];
 31     int ch[maxn][2];
 32     int pre[maxn];
 33     int root ,top1,top2;
 34     int ss[maxn],que[maxn];
 35     
 36     inline void Rotate(int x,int f){
 37         int y = pre[x];
 38         push_down(y);
 39         push_down(x);
 40         ch[y][!f] = ch[x][f];
 41         pre[ch[x][f]] = y ; 
 42         pre[x] = pre[y];
 43         if(pre[x]) ch[pre[y]][ch[pre[y]][1] == y] = x; 
 44         ch[x][f] = y ; 
 45         pre[y] = x ; 
 46         push_up(y);
 47     }
 48     inline void Splay(int x, int goal){
 49          push_down(x);
 50          while(pre[x] != goal){
 51             if(pre[pre[x]] == goal){
 52                 Rotate(x, ch[pre[x]][0] == x);
 53             }else{
 54                int y = pre[x],z = pre[y];
 55                int f = (ch[z][0] == y);
 56                if(ch[y][f] == x){
 57                     Rotate(x,!f) , Rotate(x,f);
 58                }else{
 59                     Rotate(y,f) , Rotate(x,f);
 60                }
 61             }
 62          }
 63          push_up(x);
 64          if(goal ==  0) root = x; 
 65     }
 66     inline void RotateTo(int k ,int goal){
 67         int x = root;
 68         push_down(x);
 69         while(sz[ch[x][0]] != k ){
 70             if(k < sz[ ch[x][0] ]){
 71                 x = ch[x][0];
 72             }else{
 73                 k -= (sz[ch[x][0]] + 1);
 74                 x = ch[x][1];
 75             }
 76             push_down(x);
 77         }
 78         Splay(x,goal);
 79     }
 80     inline void erase(int x){
 81         int father = pre[x];
 82         int head = 0 , tail = 0 ; 
 83         for(que[tail ++] = x ; head < tail ;head ++){
 84             ss[top2++] = que[head];
 85             if(ch[que[head] ][0]) que[tail ++] = ch[que[head]][0];
 86             if(ch[que[head] ][1]) que[tail ++] = ch[que[head]][1];
 87         }
 88         ch[father][ch[father][1] == x] = 0 ;
 89         push_up(father);
 90     }
 91     inline void NewNode(int &x,int c){
 92          if(top2) x = ss[--top2];
 93          else x = ++top1;
 94          ch[x][0] = ch[x][1] = pre[x] = 0 ; 
 95          sz[x] = 1; 
 96          val[x] = sum[x] = c;
 97     }
 98     inline void push_down(int x){
 99 
100     }
101     inline void push_up(int x){
102         sz[x] = 1 + sz[ch[x][0]] + sz[ch[x][1]]; 
103         sum[x] = val[x] + sum[ch[x][0]] + sum[ch[x][1]];    
104     }
105     inline void makeTree(int &x,int l ,int r,int f){
106         if(l > r) return ; 
107         int m = (l + r ) >> 1; 
108         NewNode(x,num[m]);
109         makeTree(ch[x][0],l,m-1,x);
110         makeTree(ch[x][1],m+1,r,x);
111         pre[x] = f;
112         push_up(x);
113     }
114     inline void init(int n){
115         ch[0][0] = ch[0][1] = pre[0] = sz[0] = 0 ; 
116         sum[0] = 0 ; 
117         root = top1 = 0 ; 
118         NewNode(root,-1);
119         NewNode(ch[root][1],-1);
120         pre[top1] = root;
121         sz[root] = 2; 
122 
123         for(int i =  1 ;i <= n;i ++) scanf("%d",&num[i]);
124         makeTree(ch[ch[root][1]][0],1,n,ch[root][1]);
125         push_up(ch[root][1]);
126         push_up(root);
127 
128     }
129     inline void update(int l,int v){
130       RotateTo(l,0);
131       val[root] += v;  
132     }
133     inline void query(int l , int r){
134        RotateTo(l-1,0);
135        RotateTo(r+1,root);
136        printf("%lld\n",sum[ch[ch[root][1]][0]]);
137     } 
138     int num[maxn];
139     LL sum[maxn];
140     int val[maxn];
141 }spt;
142 char str[10];
143 int ta,tb;
144 int main(){
145     scanf("%d",&t);
146     for(int CA = 1; CA <= t ; CA ++)
147     {
148             printf("Case %d:\n",CA);
149             scanf("%d",&n);
150             spt.init(n);
151             while(scanf("%s",str)!= EOF)
152             {
153                 if(str[0] == ‘E‘)
154                     break;
155                 scanf("%d %d",&ta,&tb);
156                 if(str[0] == ‘Q‘)    
157                 {
158                     spt.query(ta,tb);        
159                 }else if(str[0] == ‘A‘){
160                     spt.update(ta,tb);
161                 }else if(str[0] == ‘S‘){
162                     spt.update(ta,-tb);
163                 }else {
164                     break;
165                 }
166                 //printf("%lld\n",spt.sum[1]);
167             }
168     }
169 
170 return 0;
171 }