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
| #include <bits/stdc++.h> #define MAXN 100005 using namespace std; inline int read() { int x=0,f=1; char ch=getchar(); while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); } while (ch>='0'&&ch<='9') { x=(x*10)+(ch-'0'); ch=getchar(); } return x*f; } int a[MAXN]; bool DBG=true; namespace SegmentTree{ struct node{ int sum; int l,r; int maxs; int mins; int maxsl; int maxsr; int minsl; int minsr; int maxl,minl; int maxlp,minlp; int maxr,minr; int maxrp,minrp; bool flag; }tree[MAXN<<2]; inline void sw(int &a,int &b){int temp=a;a=b;b=temp;} inline void re(int &a){a=-a;} inline void Rev(int i){ re(tree[i].sum); sw(tree[i].maxs,tree[i].mins); re(tree[i].maxs),re(tree[i].mins); sw(tree[i].maxsl,tree[i].minsl); sw(tree[i].maxsr,tree[i].minsr); sw(tree[i].maxl,tree[i].minl); re(tree[i].maxl),re(tree[i].minl); sw(tree[i].maxlp,tree[i].minlp); sw(tree[i].maxr,tree[i].minr); re(tree[i].maxr),re(tree[i].minr); sw(tree[i].maxrp,tree[i].minrp); tree[i].flag^=1; } #define lc i<<1 #define rc i<<1|1 #define nd tree[i] inline void pushdown(int i){ if (tree[i].flag) Rev(lc),Rev(rc),tree[i].flag=0; } node operator + (const node &A,const node &B){ node C; C.l=A.l,C.r=B.r; C.sum=A.sum+B.sum; C.flag=false; if (max(A.maxs,B.maxs)>A.maxr+B.maxl){ if (A.maxs>B.maxs){ C.maxs=A.maxs; C.maxsl=A.maxsl; C.maxsr=A.maxsr; } else { C.maxs=B.maxs; C.maxsl=B.maxsl; C.maxsr=B.maxsr; } } else { C.maxs=A.maxr+B.maxl; C.maxsl=A.maxrp; C.maxsr=B.maxlp; } if (min(A.mins,B.mins)<A.minr+B.minl){ if (A.mins<B.mins){ C.mins=A.mins; C.minsl=A.minsl; C.minsr=A.minsr; } else { C.mins=B.mins; C.minsl=B.minsl; C.minsr=B.minsr; } } else { C.mins=A.minr+B.minl; C.minsl=A.minrp; C.minsr=B.minlp; } if (A.sum+B.maxl>A.maxl){ C.maxl=A.sum+B.maxl; C.maxlp=B.maxlp; } else { C.maxl=A.maxl; C.maxlp=A.maxlp; } if (A.sum+B.minl<A.minl){ C.minl=A.sum+B.minl; C.minlp=B.minlp; } else { C.minl=A.minl; C.minlp=A.minlp; } if (A.maxr+B.sum>B.maxr){ C.maxr=A.maxr+B.sum; C.maxrp=A.maxrp; } else { C.maxr=B.maxr; C.maxrp=B.maxrp; } if (A.minr+B.sum<B.minr){ C.minr=A.minr+B.sum; C.minrp=A.minrp; } else { C.minr=B.minr; C.minrp=B.minrp; } return C; } inline void pushup(int i){ bool temp=tree[i].flag; tree[i]=tree[lc]+tree[rc]; tree[i].flag=temp; } inline void Set(int i,int val){ nd.sum=nd.maxs=nd.mins=nd.maxl=nd.minl=nd.maxr=nd.minr=val; } void Build(int l,int r,int i){ tree[i].flag=0; if (l==r){ tree[i].l=l,tree[i].r=l; Set(i,a[l]); nd.maxsl=nd.maxsr=nd.minsl=nd.minsr=nd.maxlp=nd.minlp=nd.maxrp=nd.minrp=l; return ; } int mid=(l+r)>>1; Build(l,mid,lc); Build(mid+1,r,rc); pushup(i); } node Query(int L,int R,int i){ if (L<=tree[i].l&&tree[i].r<=R){ return tree[i]; } pushdown(i); int mid=(tree[i].l+tree[i].r)>>1; if (mid>=R) return Query(L,R,lc); else if (mid<L) return Query(L,R,rc); else return Query(L,R,lc)+Query(L,R,rc); } void Update(int L,int R,int i){ if (L<=tree[i].l&&tree[i].r<=R){ Rev(i); return ; } pushdown(i); int mid=(tree[i].l+tree[i].r)>>1; if (mid>=R) Update(L,R,lc); else if (mid<L) Update(L,R,rc); else Update(L,R,lc),Update(L,R,rc); pushup(i); } void Update_pos(int index,int i,int val){ if (tree[i].l==tree[i].r){ Set(i,tree[i].flag?-val:val); return ; } pushdown(i); int mid=(tree[i].l+tree[i].r)>>1; if (index<=mid) Update_pos(index,lc,val); else Update_pos(index,rc,val); pushup(i); } } using namespace SegmentTree; int L[MAXN],R[MAXN]; int main(){ int n=read(); for (register int i=1;i<=n;++i){ a[i]=read(); } Build(1,n,1); int q=read(); while (q--){ int opr=read(); if (opr==1){ int l=read(),r=read(),k=read(); int tot=0,ans=0; for (register int i=1;i<=k;++i){ node Q=Query(l,r,1); if (Q.maxs<=0) break; ans+=Q.maxs; L[++tot]=Q.maxsl,R[tot]=Q.maxsr; Update(L[tot],R[tot],1); } for (register int i=1;i<=tot;++i){ Update(L[i],R[i],1); } printf("%d\n",ans); } else { int i=read(),val=read(); Update_pos(i,1,val); } } }
|