hud--4251The Famous ICPC Team Again+划分树入门题
2015-08-07 14:25
387 查看
题目链接:点击进入
这次求得是给定区间的中值,所以还是直接可以套划分树的模板。
代码如下:
这次求得是给定区间的中值,所以还是直接可以套划分树的模板。
代码如下:
#include<iostream> #include<cstring> #include<cstdio> #include<algorithm> using namespace std; const int maxn=100000+100; 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)>>1; int same=mid-l+1; for(int i=l;i<=r;i++) if(tree[dep][i]<sorted[mid]) same--; int lpos=l; int 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)>>1; 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 main() { int n,Case=1; freopen("in.txt","r",stdin); while(scanf("%d",&n)!=EOF) { printf("Case %d:\n",Case++); memset(tree,0,sizeof(tree)); for(int i=1;i<=n;i++) { scanf("%d",&tree[0][i]); sorted[i]=tree[0][i]; } sort(sorted+1,sorted+n+1); build(1,n,0); int m; scanf("%d",&m); while(m--) { int A,B; scanf("%d%d",&A,&B); int k=(B-A)/2+1; printf("%d\n",query(1,n,A,B,0,k)); } } return 0; }
相关文章推荐
- 2015 Multi-University Training Contest 6 solutions BY ZJU(部分解题报告)
- Hdu 2015 Multi-University Training Contest6
- 解决服务器出现大量CLOSE_WAIT和TIME_WAIT连接的方法
- CLOSE_WAIT生成的原因
- 2015 Multi-University Training Contest 3
- 2015 Multi-University Training Contest 6 solutions BY ZJU(部分解题报告)
- ERROR 1396 (HY000): Operation CREATE USER failed for 'root'@'localhost'
- 使用AIDL实现进程间的通信之复杂类型传递
- 使用AIDL实现进程间的通信
- http://www.sqlservercentral.com/articles/Failover+Clustered+Instance+(FCI)/92196/
- 人工智能领域的会议和期刊
- http://blog.csdn.net/luobin369/article/details/8537897
- (leetcode)Contains Duplicate II
- Failed to create the host-only adapte
- WAI-ARIA无障碍网页应用
- LVM&RAID
- *Delete Duplicate Emails
- Codeforces 567A Lineland Mail
- Injection of autowired dependencies failed
- codeforces(567A)--A. Lineland Mail--B. Berland National Library