直播获奖
思路:
留意数据范围,每个人的成绩在0\sim 6000∼600之间,可以用树状数组当桶来存每个分数的数量,然后利用二分来找到第k名对应的分数,二分满足单调性,虽然不连续,但最后一次比需要的分数大的分数就是答案。
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5+7;
inline ll read() {
ll s = 0, w = 1;
char ch = getchar();
while (ch < 48 || ch > 57) {
if (ch == '-') w = -1;
ch = getchar();
}
while (ch >= 48 && ch <= 57)
s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
return s * w;
}
int Max(int a,int b){
return a>=b?a:b;
}
int tree[600],ans[maxn],b;
#define lowbit(x) ((x)&-(x))
void add(int x,int d) {
while(x<=600) {
tree[x]+=d;
x+=lowbit(x);
}
}
int sum(int x) {
int sum=0;
while(x) {
sum+=tree[x];
x-=lowbit(x);
}
return sum+b;
}
int findpos(int x) {
int l=0,r=600;
while(l<r) {
int mid=(l+r)>>1;
if(sum(mid)<x) l=mid+1;
else r=mid;
}
return l;
}
int main() {
int n=read(),w=read();
for(int i=1,x,ran;i<=n;++i) {
x=read(),ran=Max(1,i*w/100);
if(x)
add(x,1);
else
++b;
printf("%d ",findpos(i-ran+1));
}
return 0;
}