codeforces 706B B. Interesting drink(二分)
2016-08-12 10:24
375 查看
题目链接:
B. Interesting drink
题意:
给出第i个商店的价钱为x[i],现在询问mi能在多少个地方买酒;
思路:
sort后再二分;
AC代码:
B. Interesting drink
题意:
给出第i个商店的价钱为x[i],现在询问mi能在多少个地方买酒;
思路:
sort后再二分;
AC代码:
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <cmath> #include <map> #include <bits/stdc++.h> using namespace std; #define For(i,j,n) for(int i=j;i<=n;i++) #define mst(ss,b) memset(ss,b,sizeof(ss)); typedef long long LL; template<class T> void read(T&num) { char CH; bool F=false; for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar()); for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar()); F && (num=-num); } int stk[70], tp; template<class T> inline void print(T p) { if(!p) { puts("0"); return; } while(p) stk[++ tp] = p%10, p/=10; while(tp) putchar(stk[tp--] + '0'); putchar('\n'); } const LL mod=998244353; const double PI=acos(-1.0); const LL inf=1e18; const int N=1e5+10; const int maxn=1e3+10; const double eps=1e-4; int n,a ; int main() { read(n); For(i,1,n)read(a[i]); sort(a+1,a+n+1); int q,m; read(q); while(q--) { read(m); int l=1,r=n; while(l<=r) { int mid=(l+r)>>1; if(a[mid]<=m)l=mid+1; else r=mid-1; } printf("%d\n",l-1); } return 0; }
相关文章推荐
- Codeforces 474B Worms 二分(水
- Codeforces 732D 二分
- codeforces 545C C. Woodcutters(dp+二分)
- 【codeforces 782B】The Meeting Place Cannot Be Changed(二分)
- codeforces 801C Voltage Keepsake 二分答案
- CodeForces - 812C Sagheer and Nubian Market 二分
- codeforces 493C Vasya and Basketball(二分)
- Codeforces 237C:Primes on Interval(素数打表+二分)
- codeforces 689D ST表+二分 模板
- Codeforces-786C-Till I Collapse(二分剪枝)
- codeforces 817C Really Big Numbers 二分
- Codeforces 817C Really Big Numbers【思维+二分】
- CodeForces 627D Preorder Test(树形DP+二分)
- Codeforces 702 B. Powers of Two(二分)
- 文章标题 codeforces 75C:Modified GCD (二分+最大公因数)
- Codeforces 589G Hiring(BIT + 二分)
- codeforces 734 C. Anton and Making Potions (二分 STL)
- 【二分】Codeforces 706B Interesting drink
- codeforces 74B. Arpa’s obvious problem and Mehrdad’s terrible solution (异或+二分STL)
- Codeforces 670 D1. Magic Powder - 1【二分查找】