标签：
| F.A.Qs | Home | Discuss | ProblemSet | Status | Ranklist | Contest | ModifyUser gryz2016 | Logout | 捐赠本站 |
|---|
题解：
个人用块状链表写的，
对于首尾块用暴力更新，中间的加add标志。
第一次提交超时，很奇怪，然后发现循环套快排了，我去，坑了我2h。。。
代码：
1 #include<cstdio> 2 #include<cmath> 3 #include<algorithm> 4 #define maxn 1000010 5 #define logmaxn 100010 6 7 using namespace std; 8 9 int a[maxn],up[logmaxn],belong[maxn],l[logmaxn],r[logmaxn],b[maxn],sum; 10 int n,m,sqrp,gs,ans; 11 int main() 12 { 13 scanf("%d%d",&n,&m); 14 for (int i=1;i<=n;i++) scanf("%d",&a[i]); 15 sqrp=sqrt(n); 16 if (n%sqrp) gs=n/sqrp+1; 17 else gs=n/sqrp; 18 for (int i=1;i<=gs;i++) 19 l[i]=(i-1)*sqrp+1,r[i]=i*sqrp; 20 r[gs]=n; 21 for (int i=n;i>0;i--) 22 belong[i]=(i-1)/sqrp+1; 23 for (int i=1;i<=gs;i++) 24 { 25 for (int j=l[i];j<=r[i];j++) 26 b[j]=a[j]; 27 sort(b+l[i],b+r[i]+1); 28 } 29 for (int i=1;i<=m;i++) 30 { 31 char ch[1]; 32 int ll,rr,x; 33 scanf("%s%d%d%d",ch,&ll,&rr,&x); 34 int lll=belong[ll]; 35 int rrr=belong[rr]; 36 switch(ch[0]) 37 { 38 case ‘M‘: 39 if (lll==rrr) 40 { 41 for (int j=ll;j<=rr;j++) 42 a[j]=a[j]+x; 43 for (int j=l[lll];j<=r[lll];j++) 44 b[j]=a[j]; 45 sort(b+l[lll],b+r[lll]+1); 46 } 47 else 48 { 49 for (int j=ll;j<=r[lll];j++) 50 a[j]+=x; 51 for (int j=l[lll];j<=r[lll];j++) 52 b[j]=a[j]; 53 sort(b+l[lll],b+r[lll]+1); 54 for (int j=l[rrr];j<=rr;j++) 55 a[j]+=x; 56 for (int j=l[rrr];j<=r[rrr];j++) 57 b[j]=a[j]; 58 sort(b+l[rrr],b+r[rrr]+1); 59 for (int j=lll+1;j<rrr;j++) 60 up[j]+=x; 61 } 62 break; 63 case ‘A‘: 64 if (lll==rrr) 65 { 66 for (int j=ll;j<=rr;j++) 67 if (a[j]+up[lll]>=x) ans++; 68 } 69 else 70 { 71 for (int j=ll;j<=r[lll];j++) 72 if (a[j]+up[lll]>=x) ans++; 73 74 for (int j=l[rrr];j<=rr;j++) 75 if (a[j]+up[rrr]>=x) ans++; 76 for (int j=lll+1;j<=rrr-1;j++) 77 { 78 sum=lower_bound(b+l[j],b+r[j]+1,x-up[j])-b; 79 ans+=r[j]+1-sum; 80 } 81 } 82 printf("%d\n",ans); 83 ans=0; 84 break; 85 } 86 } 87 return 0; 88 }
数据生成器：
#include<iostream> #include<cstdlib> #include<cstdio> #include<time.h> using namespace std; int main() { srand(time(0)); freopen("magic.txt","w",stdout); int n=1000000,q=3000; cout<<n<<‘ ‘<<q<<endl; for(int i=1;i<=n;i++) cout<<rand()%1000+1<<endl; cout<<endl; for(int i=1;i<=q;i++) { int f=rand()%2; int l=rand()%n+1,r=rand()%n+1; if(r<l)swap(l,r); if(f)cout<<‘A‘<<‘ ‘<<l<<‘ ‘<<r<<‘ ‘<<rand()%1000<<endl; else cout<<‘M‘<<‘ ‘<<l<<‘ ‘<<r<<‘ ‘<<rand()%1000000000<<endl; } return 0; }
标签：
原文地址：http://www.cnblogs.com/grhyxzc/p/5131550.html
