codeforces706B(二分)之Interesting drink
来源:互联网 发布:树莓派gpio编程工具 编辑:程序博客网 时间:2024/05/19 11:49
Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink "Beecola", which can be bought in n different shops in the city. It's known that the price of one bottle in the shop i is equal to xi coins.
Vasiliy plans to buy his favorite drink for q consecutive days. He knows, that on the i-th day he will be able to spent mi coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of "Beecola".
The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of shops in the city that sell Vasiliy's favourite drink.
The second line contains n integers xi (1 ≤ xi ≤ 100 000) — prices of the bottles of the drink in the i-th shop.
The third line contains a single integer q (1 ≤ q ≤ 100 000) — the number of days Vasiliy plans to buy the drink.
Then follow q lines each containing one integer mi (1 ≤ mi ≤ 109) — the number of coins Vasiliy can spent on the i-th day.
Print q integers. The i-th of them should be equal to the number of shops where Vasiliy will be able to buy a bottle of the drink on the i-th day.
53 10 8 6 114110311
0415
On the first day, Vasiliy won't be able to buy a drink in any of the shops.
On the second day, Vasiliy can buy a drink in the shops 1, 2, 3 and 4.
On the third day, Vasiliy can buy a drink only in the shop number 1.
Finally, on the last day Vasiliy can buy a drink in any shop.
题意:有n家店,每家店的饮料价格为xi,有q天,Vasiliy每一天的为mi,问Vasiliy每天最多可以去多少家店????
分析:用二分是最简单的
AC代码如下:
#include "iostream"#include "algorithm"using namespace std;const int maxn=100000;int x[maxn],m[maxn];int main(int argc, char* argv[]){ int n,l,r,mid; int i,p; cin>>n; for (i=1; i<=n; i++) { cin>>x[i]; } sort(x+1,x+n+1); cin>>p; for (i=1; i<=p; i++) { cin>>m[i]; } for (i=1; i<=p; i++) { if (m[i]>=x[n]) { cout<<n<<endl; continue; } if (m[i]<x[1]) { cout<<0<<endl; continue; } l=1; r=n; while(l<=r) { mid=(l+r)/2; if (m[i]<x[mid]) { r=mid-1; } else { l=mid+1; if (m[i]<x[mid+1]) { cout<<mid<<endl; break; } } } } return 0;}
- codeforces706B(二分)之Interesting drink
- codeforces706B Interesting drink 排序+二分查找
- interesting drink(二分)
- 【Codeforces】-706B-Interesting drink(二分)
- Codeforces #367 B. Interesting drink(二分)
- Interesting drink--二分
- Codeforces Round #367 (Div. 2) B Interesting drink(二分)
- Codeforces Round #367 (Div. 2) B. Interesting drink (二分)
- Codeforces 706B:Interesting drink(二分+排序)
- Codeforces Round #367 (Div. 2) B. Interesting drink (二分)
- Codeforces Round #367 (Div. 2) B. Interesting drink(二分)
- codeforces 706B B. Interesting drink (二分)
- 【二分】Codeforces 706B Interesting drink
- Codeforces 706B Interesting drink 【二分】
- Interesting drink
- Interesting drink
- Codeforces Round #367 (Div. 2) B Interesting drink【二分】
- 【Codeforces Round 367 (Div 2) B】【二分查找】Interesting drink
- Spring和Mybatis整合时无法读取properties的处理方案
- 题理综
- Spring 学习理解及第一个demo
- 51nod 1489 蜥蜴和地下室(DFS)
- matlab 图片显示 imshow axis title xlabel ylabel plot
- codeforces706B(二分)之Interesting drink
- hdu 5855 Less Time, More profit(最大权闭合子图)
- [LeetCode] 97. Interleaving String
- windows 下安装Django小记
- HDU 5839 Special Tetrahedron(计算几何)——2016中国大学生程序设计竞赛 - 网络选拔赛
- Ubuntu 环境变量文件介绍
- 长相思 天才
- JS MutationObserver 笔记
- matlab 取整函数 fix floor ceil round