标签:des style http color io os ar java for
划分树+二分
1 10 10 0 5 2 7 5 4 3 8 7 7 2 8 6 3 5 0 1 3 1 1 9 4 0 1 0 3 5 5 5 5 1 4 6 3 1 5 7 5 7 3
Case 1: 4 0 0 3 1 2 0 1 5 1
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int maxn=100100; int tree[20][maxn]; int sorted[maxn]; int toleft[20][maxn]; void build(int l,int r,int dep) { if(l==r) return ; int mid=(l+r)/2; int same=mid-l+1; for(int i=l;i<=r;i++) if(tree[dep][i]<sorted[mid]) same--; int lpos=l,rpos=mid+1; for(int i=l;i<=r;i++) { if(tree[dep][i]<sorted[mid]) tree[dep+1][lpos++]=tree[dep][i]; else if(tree[dep][i]==sorted[mid]&&same>0) { tree[dep+1][lpos++]=tree[dep][i]; same--; } else tree[dep+1][rpos++]=tree[dep][i]; toleft[dep][i]=toleft[dep][l-1]+lpos-l; } build(l,mid,dep+1); build(mid+1,r,dep+1); } int query(int L,int R,int l,int r,int dep,int k) { if(l==r) return tree[dep][l]; int mid=(L+R)/2; int cnt=toleft[dep][r]-toleft[dep][l-1]; if(cnt>=k) { int newl=L+toleft[dep][l-1]-toleft[dep][L-1]; int newr=newl+cnt-1; return query(L,mid,newl,newr,dep+1,k); } else { int newr=r+toleft[dep][R]-toleft[dep][r]; int newl=newr-(r-l-cnt); return query(mid+1,R,newl,newr,dep+1,k-cnt); } } int n,m; int bin(int l,int r,int h) { int low=1,high=r-l+1,mid,ans=0; while(low<=high) { mid=(low+high)/2; int temp=query(1,n,l,r,0,mid); if(h>=temp) { ans=mid; low=mid+1; } else high=mid-1; } return ans; } int main() { int T_T,cas=1; scanf("%d",&T_T); while(T_T--) { scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { scanf("%d",sorted+i); tree[0][i]=sorted[i]; } sort(sorted+1,sorted+1+n); build(1,n,0); int l,r,h; printf("Case %d:\n",cas++); while(m--) { scanf("%d%d%d",&l,&r,&h); l++,r++; printf("%d\n",bin(l,r,h)); } } return 0; }
标签:des style http color io os ar java for
原文地址:http://blog.csdn.net/ck_boss/article/details/39809757