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
| #include <bits/stdc++.h> #define MAXN 200005 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<<3)+(x<<1)+(ch^'0'); ch=getchar(); } return x*f; } int b[MAXN],a[MAXN],temp[MAXN]; namespace SegmentTree{ struct node{ int l,r; int val,tag; inline int len(){return r-l+1;} }tree[MAXN<<2]; #define lc i<<1 #define rc i<<1|1 inline void pushup(int i){ tree[i].val=tree[lc].val+tree[rc].val; } inline void Change(int i,int val){ tree[i].val+=val*tree[i].len(); tree[i].tag+=val; } inline void pushdown(int i){ if (tree[i].tag){ Change(lc,tree[i].tag); Change(rc,tree[i].tag); tree[i].tag=0; } } void Build(int i,int l,int r){ tree[i].l=l,tree[i].r=r; if (l==r){ tree[i].val=a[l]; return ; } int mid=(l+r)>>1; Build(lc,l,mid); Build(rc,mid+1,r); pushup(i); } void Update(int i,int L,int R,int val){ if (L<=tree[i].l&&tree[i].r<=R){ Change(i,val); return ; } pushdown(i); int mid=(tree[i].l+tree[i].r)>>1; if (L<=mid) Update(lc,L,R,val); if (mid<R) Update(rc,L,R,val); pushup(i); } int Query(int i,int L,int R){ if (L<=tree[i].l&&tree[i].r<=R){ return tree[i].val; } pushdown(i); int mid=(tree[i].l+tree[i].r)>>1,ans=0; if (L<=mid) ans+=Query(lc,L,R); if (mid<R) ans+=Query(rc,L,R); return ans; } } using namespace SegmentTree; int main(){ int n=read(),m=read(); for (register int i=1;i<=n;++i){ b[i]=read(); } for (register int i=1;i<=n;++i){ a[i]=b[i]-b[i-1]; } Build(1,1,n); while (m--){ int opr=read(); if (opr==1){ int l=read(),r=read(),k=read(),d=read(); Update(1,l,l,k); if (l<r){ Update(1,l+1,r,d); } if (r!=n) Update(1,r+1,r+1,-k-d*(r-l)); } else if (opr==2){ int p=read(); printf("%d\n",Query(1,1,p)); } } }
|