zoj 3635 Cinema in Akiba (树状数组求第K大)
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了zoj 3635 Cinema in Akiba (树状数组求第K大)，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含3765字，纯文字阅读大概需要6分钟。
内容图文
Cinema in Akiba
Cinema in Akiba (CIA) is a small but very popular cinema in Akihabara. Every night the cinema is full of people. The layout of CIA is very interesting, as there is only one row so that every audience can enjoy the wonderful movies without any annoyance by other audiences sitting in front of him/her.
The ticket for CIA is strange, too. There are n seats in CIA and they are numbered from 1 to n in order. Apparently, n tickets will be sold everyday. When buying a ticket, if there are k tickets left, your ticket number will be an integer i (1 ≤ i ≤ k), and you should choose theith empty seat (not occupied by others) and sit down for the film.
On November, 11th, n geeks go to CIA to celebrate their anual festival. The ticket number of the ith geek is ai. Can you help them find out their seat numbers?
Input
The input contains multiple test cases. Process to end of file.
The first line of each case is an integer n (1 ≤ n ≤ 50000), the number of geeks as well as the number of seats in CIA. Then follows a line containing n integers a1, a2, ..., an (1 ≤ ai ≤ n - i + 1), as described above. The third line is an integer m (1 ≤ m ≤ 3000), the number of queries, and the next line is m integers, q1, q2, ..., qm (1 ≤ qi ≤ n), each represents the geek‘s number and you should help him find his seat.
Output
For each test case, print m integers in a line, seperated by one space. The ith integer is the seat number of the qith geek.
Sample Input
3 1 1 1 3 1 2 3 5 2 3 3 2 1 5 2 3 4 5 1
Sample Output
1 2 3 4 5 3 1 2
思路比较清晰。
树状数组+二分
具体见注释
1
/*
************************************************************************
2
> File Name: code/zoj/3635.cpp
3
> Author: 111qqz
4
> Email: rkz2013@126.com
5
> Created Time: 2015年10月22日 星期四 10时03分36秒
6
***********************************************************************
*/
7
8 #include<iostream>
9 #include<iomanip>
10 #include<cstdio>
11 #include<algorithm>
12 #include<cmath>
13 #include<cstring>
14 #include<string>
15 #include<map>
16 #include<set>
17 #include<queue>
18 #include<vector>
19 #include<stack>
20 #include<cctype>
21 22#define yn hez111qqz
23#define j1 cute111qqz
24#define ms(a,x) memset(a,x,sizeof(a))
25usingnamespace std;
26constint dx4[4]={1,0,0,-1};
27constint dy4[4]={0,-1,1,0};
28 typedef longlong LL;
29 typedef double DB;
30constint inf = 0x3f3f3f3f;
31constint N=5E5+7;
32int t[N],a[N];
33int ans[N],k;
34int n,m;
35 36 37int lowbit( int x)
38{
39return x&(-x);
40}
41void update ( int x,int delta)
42{
43for ( int i = x ; i <= n ; i = i + lowbit(i))
44 {
45 t[i] = t[i] + delta;
46 }
47}
48 49int sum( int x)
50{
51int res = 0 ;
52for ( int i = x; i >= 1 ; i = i - lowbit(i))
53 {
54 res = res + t[i];
55 }
56return res;
57}
58 59int bin_search(int l,int r)
60{
61while (l<r)
62 {
63int mid = (l+r)>>1;
64if (sum(mid)<k)
65 l = mid + 1;
66else r = mid ;
67 }
68return r;
69}
70int main()
71{
72 #ifndef ONLINE_JUDGE
73 freopen("in.txt","r",stdin);
74#endif 75 76while (scanf("%d",&n)!=EOF)
77 {
78 79 ms(t,0);
80 ms(ans,0);
81 ms(a,0);
82for ( int i = 1 ; i <= n ; i++) update(i,1); //1表示没有被占，初始所有位置都没有被占。 83 84for ( int i = 1 ; i <= n ; i++)
85 {
86 87 scanf("%d",&k); //每次要占第k个没有被占的位置，由于被占的位置被设置成0,所以就是找第k大的。 88 89int posi = bin_search(1,n);
90 ans[i] =posi;
91 update(posi,-1); //将被占的位置设置成0 92 93 }
94 95 96 97 98 scanf("%d",&m);
99int x;
100for ( int i = 1 ; i < m ; i++)
101 {
102 scanf("%d",&x);
103 printf("%d ",ans[x]);
104 }
105 scanf("%d",&x);
106 printf("%d\n",ans[x]);
107108 }
109110111 #ifndef ONLINE_JUDGE
112 fclose(stdin);
113#endif114return0;
115 }
原文：http://www.cnblogs.com/111qqz/p/4900182.html
内容总结
以上是互联网集市为您收集整理的zoj 3635 Cinema in Akiba (树状数组求第K大)全部内容，希望文章能够帮你解决zoj 3635 Cinema in Akiba (树状数组求第K大)所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。