疯狂的块状链表……
我写个半成品程序放这儿坑着……不知道哪天会填坑……
感觉写到快崩溃了……
jcvb写的完整版也就我这么长……但我只写了一半……orzorz
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 | #include<cstdio>#include<cmath>#include<algorithm>using namespace std;struct List{long long cur[1105],cover,rev,tag,sum,mx,mn,siz;List *prev,*next;List(List *pre,List *nex){siz=0;mx=-21000000000ll;mn=21000000000ll;sum=0;rev=0;tag=0;cover=-21000000000ll;prev=pre;next=nex;}void Renew(long long k){mx=max(mx,k);mn=min(mn,k);sum+=k;}void Fix(){prev->next=this;next->prev=this;}}*root,*Null=new List(Null,Null);int m,n,block_size;long long a[100005],tmp[1105];void Read(long long &x){char ch;while((ch=getchar())<'0' || ch>'9');x=ch-'0';while((ch=getchar())>='0' && ch<='9')x=x*10+ch-'0';}void Read(int &x){char ch;while((ch=getchar())<'0' || ch>'9');x=ch-'0';while((ch=getchar())>='0' && ch<='9')x=x*10+ch-'0';}void PushTag(List *p){if(p->tag){ for(int i=0;i<p->siz;i++)p->cur[i]+=p->tag; p->tag=0;}}void PushCover(List *p){if(p->cover!=-21000000000ll){ for(int i=0;i<p->siz;i++)p->cur[i]=p->cover; p->cover=-21000000000ll;}}void PushRev(List *p){if(p->rev){ for(int i=0;i<p->siz/2;i++)swap(p->cur[i],p->cur[p->siz-i-1]); p->rev=0;}}void Pushdown(List *p){PushTag(p);PushCover(p);PushRev(p);}void CopyTags(List *p,List *q){p->cover=q->cover;p->tag=q->tag;p->rev=q->rev;}List* Split(List *lis,int k){List *p=new List(lis,lis->next);lis->next=p;lis->Fix();p->Fix();PushRev(lis);CopyTags(p,lis);lis->mx=-21000000000ll;lis->mn=21000000000ll;lis->sum=0;for(int i=0;i<=k;i++){ lis->Renew(lis->cur[i]);}lis->siz=k+1;if(p->cover)return p;for(int i=k+1;i<lis->siz;i++){ p->cur[p->siz++]=lis->cur[i]; p->Renew(lis->cur[i]);}return p;}List* Merge(List *p,List *q){p->next=q;q->prev=p;p->Fix();q->Fix();Pushdown(p);Pushdown(q);for(int i=0;i<q->siz;i++){ p->cur[p->siz++]=q->cur[i]; p->Renew(q->cur[i]);}return p;}void Swap(List *p,List *q){p->prev->next=q;q->next->prev=p;p->next->prev=q;q->prev->next=p;swap(p->next,q->next);swap(p->prev,q->prev);}pair<List*,int> Location(int pos){List *i;for(i=root;i!=Null && pos>i->siz;pos-=i->siz,i=i->next);return make_pair(i,pos-1);}///Wo Mei You You Hua block_size;void Insert(int pos,long long val){pair<List*,int> Real=Location(pos);Real.second++;Pushdown(Real.first);for(int i=Real.first->siz;i>Real.second;i--){ Real.first->cur[i]=Real.first->cur[i-1];}Real.first->siz++;Real.first->cur[Real.second]=val;Real.first->Renew(val);if(Real.first->siz>2*block_size){Split(Real.first,Real.first->siz/2);}}void Delete(int pos){pair<List*,int> Real=Location(pos);Pushdown(Real.first);Real.first->mx=-2100000000ll;Real.first->mn=21000000000ll;Real.first->sum=0;for(int i=0;i<Real.second;i++)Real.first->Renew(Real.first->cur[i]);for(int i=Real.second+1;i<Real.first->siz;i++){ Real.first->Renew(Real.first->cur[i]); Real.first->cur[i-1]=Real.first->cur[i];}Real.first->siz--;if(Real.first->siz<block_size/2){ if(Real.first->next!=Null){Merge(Real.first,Real.first->next);} else { if(Real.first->prev!=Null){Merge(Real.first->prev,Real.first);} }}}void Reverse(int l,int r){pair<List*,int> R1=Location(l),R2=Location(r);Pushdown(R1.first);Pushdown(R2.first);List *p=Split(R1.first,R1.second),*q=Split(R2.first,R2.second)->prev;int flag=0;for(List *i=p;i!=q;i=i->next){i->rev^=1;}for(;p!=q && p!=q->next;p=p->next,q=q->prev)Swap(p,q);}void True_rotate(List *lis,int k){int cnt=0,Circle=lis->siz;for(int i=0;i<Circle;i++){ tmp[(++cnt+k-1)%Circle+1]=lis->cur[i];}for(int i=0;i<Circle;i++){ lis->cur[i]=tmp[i-k+1];}}void Rotate(int l,int r,int k){pair<List*,int> R1=Location(l),R2=Location(r);if(R1.first==R2.first){ List *p=Split(R1.first,R1.second-1),*q=Split(R1.first->next,R2.second-R1.second+1)->prev; p=Merge(p,q); True_rotate(p,k); return;}if(R1.first->next==R2.first){ List *p=Split(R1.first,R1.second-1),*q=Split(R2.first,R2.second)->prev; p=Merge(p,q); True_rotate(p,k); return;}}void Add(int l,int r,long long v){}void Cover(int l,int r,long long val){}long long Sum(int l,int r){}long long MinAbs(int l,int r){}long long PrevNext(int l,int r,long long val){}long long Kth(int l,int r,int k){}int Rank(int l,int r,long long val){}int main(){freopen("3337.in","r",stdin);freopen("3337.out","w",stdout);Read(n);for(int i=1;i<=n;i++){ Read(a[i]);}block_size=(int)sqrt((double)n);root=new List(Null,Null);List *p=root;int Count=0;for(int i=1;i<=n;i++){if((i-1)%block_size==0 && i!=1){ p->next=new List(p,Null); p->siz=Count; p=p->next; Count=0;}p->Renew(a[i]);p->cur[Count++]=a[i];}p->siz=Count;Read(m);while(m--){ int opt,l,r,k; long long v; Read(opt); if(opt==1){ Read(k);Read(v); Insert(k,v); } if(opt==2){ Read(k); Delete(k); } if(opt==3){ Read(l);Read(r); Reverse(l,r); } if(opt==4){ Read(l);Read(r);Read(k); Rotate(l,r,k); } if(opt==5){ Read(l);Read(r);Read(v); Add(l,r,v); } if(opt==6){ Read(l);Read(r);Read(v); Cover(l,r,v); } if(opt==7){ Read(l);Read(r); printf("%lld\n",Sum(l,r)); } if(opt==8){ Read(l);Read(r); printf("%lld\n",MinAbs(l,r)); } if(opt==9){ Read(l);Read(r);Read(v); printf("%lld\n",PrevNext(l,r,v)); } if(opt==10){ Read(l);Read(r);Read(k); printf("%lld\n",Kth(l,r,k)); } if(opt==11){ Read(l);Read(r);Read(v); printf("%d\n",Rank(l,r,v)); }}return 0;} |
评论 (0)
