分块练习 B

来源：互联网发布：中国推理小说知乎编辑：程序博客网时间：2024/06/04 19:45
哇..偷懒调了一上午。。。结果是傻逼错。。。没救了
#include<cstdio>#include<cstring>#include<algorithm>#include<cctype>#include<iostream>#include<cmath>using namespace std;#define maxn 50010char _c;bool flag;inline void read(int& x){flag = false;_c = getchar();x = 0;while(!isdigit(_c)){if(_c=='-')flag=true;_c=getchar();}while(isdigit(_c)){x = x*10+_c-'0';_c=getchar();}if(flag)x = -x;}typedef long long LL;inline void read(LL& x){flag = false;_c = getchar();x = 0;while(!isdigit(_c)){if(_c=='-')flag=true;_c=getchar();}while(isdigit(_c)){x = x*10+_c-'0';_c=getchar();}if(flag)x = -x;}int n;int belong[maxn],L[maxn],R[maxn],num,block;LL a[maxn],add[maxn],sorted[maxn];inline void build(){block = sqrt(n);num = n/block;if(n%block)num++;for(int i=1;i<=num;i++)L[i]=(i-1)*block+1,R[i]=i*block;R[num] = n;for(int i=1;i<=n;i++)belong[i] = (i-1)/block+1;memcpy(sorted,a,sizeof(a));for(int i=1;i<=num;i++)sort(&sorted[L[i]],&sorted[R[i]+1]);}void update(int x,int y,int w){if(belong[x]==belong[y]){for(int i=x;i<=y;i++)a[i]+=w;for(int i=L[belong[x]];i<=R[belong[x]];i++)sorted[i] = a[i];sort(&sorted[L[belong[x]]],&sorted[R[belong[y]]+1]);return ;}for(int i=x;i<=R[belong[x]];i++)a[i]+=w;for(int i=L[belong[x]];i<=R[belong[x]];i++)sorted[i]=a[i];sort(&sorted[L[belong[x]]],&sorted[R[belong[x]]+1]);for(int i=belong[x]+1;i<belong[y];i++)add[i]+=w;for(int i=L[belong[y]];i<=y;i++)a[i]+=w;for(int i=L[belong[y]];i<=R[belong[y]];i++)sorted[i]=a[i];sort(&sorted[L[belong[y]]],&sorted[R[belong[y]]+1]);}int calc(int low,int up,LL ch){if(low==up)return sorted[low]<ch?1:0;int left = low;while(low<=up){int mid = (low+up)>>1;if(sorted[mid]>=ch){up = mid-1;}else {low = mid+1;}}return up-left+1;}int ask(int x,int y,LL k){LL ch;int ret = 0;if(belong[x]==belong[y]){ch = k - add[belong[x]];for(int i=x;i<=y;i++)if(a[i]<ch)ret++;return ret;}for(int i=x,ch = k-add[belong[x]];i<=R[belong[x]];i++)if(a[i]<ch)ret++;for(int i=belong[x]+1;i<belong[y];i++){ch = k - add[i];if(sorted[L[i]]>=ch)continue;ret+=calc(L[i],R[i],ch);}for(int i=L[belong[y]],ch = k-add[belong[y]];i<=y;i++)if(a[i]<ch)ret++;return ret;}int main(void){read(n);for(int i=1;i<=n;i++)read(a[i]);int op,a,b,c;build();for(int i=1;i<=n;i++){read(op),read(a),read(b),read(c);if(op)printf("%d\n",ask(a,b,(LL)c*c));else update(a,b,c);}return 0;}
1 0