CF 567D(One-Dimensional Battle Ships-二分)
来源:互联网 发布:win10怎么ping网络 编辑:程序博客网 时间:2024/05/16 03:04
裸二分
#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<functional>#include<iostream>#include<cmath>#include<cctype>#include<ctime>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define Rep(i,n) for(int i=0;i<n;i++)#define ForD(i,n) for(int i=n;i;i--)#define RepD(i,n) for(int i=n;i>=0;i--)#define Forp(x) for(int p=pre[x];p;p=next[p])#define Forpiter(x) for(int &p=iter[x];p;p=next[p]) #define Lson (x<<1)#define Rson ((x<<1)+1)#define MEM(a) memset(a,0,sizeof(a));#define MEMI(a) memset(a,127,sizeof(a));#define MEMi(a) memset(a,128,sizeof(a));#define INF (2139062143)#define F (100000007)#define MAXN (200000+10)typedef long long ll;ll mul(ll a,ll b){return (a*b)%F;}ll add(ll a,ll b){return (a+b)%F;}ll sub(ll a,ll b){return (a-b+(a-b)/F*F+F)%F;}void upd(ll &a,ll b){a=(a%F+b%F)%F;}int n,k,a,m;int x[MAXN],x2[MAXN];bool check(int m){For(i,m) x2[i]=x[i];sort(x2+1,x2+1+m);int l=1,tot=0;For(i,m) {int len=x2[i]-l+1;tot+=len/(a+1);l=x2[i]+1;}tot+=(n+1-l+1)/(a+1);if (tot>=k) return 1;return 0;}int main(){//freopen("D.in","r",stdin);//freopen(".out","w",stdout);cin>>n>>k>>a>>m;For(i,m) scanf("%d",&x[i]);int l=1,r=m,ans=INF;while(l<=r){int m=(r+l)/2;if (check(m)) l=m+1;else r=m-1,ans=min(ans,m);}if (ans==INF) ans=-1;cout<<ans<<endl;return 0;}
0 0
- CF 567D(One-Dimensional Battle Ships-二分)
- CF D. One-Dimensional Battle Ships
- 【打CF,学算法——三星级】CodeForces 567D One-Dimensional Battle Ships (二分)
- CodeForces 567D One-Dimensional Battle Ships【二分】
- codeforces 567D. One-Dimensional Battle Ships
- Codeforces 567D One-Dimensional Battle Ships
- CodeForces 567D One-Dimensional Battle Ships
- STL(set_pair)运用 CF#Pi D. One-Dimensional Battle Ships
- codeforces(567D)--D. One-Dimensional Battle Ships
- codeforces 567D One-Dimensional Battle Ships (map维护)
- codeforces 567D One-Dimensional Battle Ships (set)
- 567D One-Dimensional Battle Ships(set)
- CodeForces #Pi D.One-Dimensional Battle Ships
- 【CodeForces】567D - One-Dimensional Battle Ships & 【51Nod】1521 - 一维战舰(STL - set & 二分)
- CF One-Dimensional Battle Ships(set运用)
- Codeforces Round #Pi (Div. 2) D. One-Dimensional Battle Ships 二分 stl应用
- D. One-Dimensional Battle Ships-二分答案-Codeforces Round #Pi (Div. 2)
- One-Dimensional Battle Ships CodeForces
- 面试题1
- Threejs创建及设置face
- bootstrap模态框打开报错
- jsp 页面显示value does not support runtime expressions
- Android 自定义View (二) 进阶
- CF 567D(One-Dimensional Battle Ships-二分)
- mysql 访问某个分区
- 实参和形参指针做函数参数时,如何改变main函数变量的值
- the user specified as a definer('root'@'%') does not exit解决办法
- hive count 记录数比mysql值少了
- USB product id / vendor id 对应厂商查询
- Fraction to Recurring Decimal
- 使用hibernate出现could not parse configuration:hibernate.cfg.xml 错误的解决办法
- 基于SSH2框架AspectJ的登录登出日志实现