poj3258River Hopscotch【二分】
2015-12-20 17:42
369 查看
Language: Default River Hopscotch
Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a rock at the start and another rock at the end, L units away from the start (1 ≤ L ≤ 1,000,000,000). Along the river between the starting and ending rocks, N (0 ≤ N ≤ 50,000) more rocks appear, each at an integral distance Di from the start (0 < Di <L). To play the game, each cow in turn starts at the starting rock and tries to reach the finish at the ending rock, jumping only from rock to rock. Of course, less agile cows never make it to the final rock, ending up instead in the river. Farmer John is proud of his cows and watches this event each year. But as time goes by, he tires of watching the timid cows of the other farmers limp across the short distances between rocks placed too closely together. He plans to remove several rocks in order to increase the shortest distance a cow will have to jump to reach the end. He knows he cannot remove the starting and ending rocks, but he calculates that he has enough resources to remove up to M rocks (0 ≤ M ≤ N). FJ wants to know exactly how much he can increase the shortest distance *before* he starts removing the rocks. Help Farmer John determine the greatest possible shortest distance a cow has to jump after removing the optimal set of M rocks. Input Line 1: Three space-separated integers: L, N, and M Lines 2..N+1: Each line contains a single integer indicating how far some rock is away from the starting rock. No two rocks share the same position. Output Line 1: A single integer that is the maximum of the shortest distance a cow has to jump after removing M rocks Sample Input 25 5 2 2 14 11 21 17 Sample Output 4 Hint Before removing any rocks, the shortest jump was a jump of 2 from 0 (the start) to 2. After removing the rocks at 2 and 14, the shortest required jump is a jump of 4 (from 17 to 21 or from 21 to 25). |
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int num[500010];
int judge(int n,int m,int L){
int l=0,ans=0;
for(int i=0;i<n;++i){
if(num[i]-l>=m){
if(L-num[i]<m)break;
ans++;l=num[i];
}
}
return ans;
}
int main()
{
int N,L,M,i,j,k;
while(scanf("%d%d%d",&L,&N,&M)!=EOF){
for(i=0;i<N;++i){
scanf("%d",&num[i]);
}
sort(num,num+N);
int left=0,right=L,ans;
while(left<=right){
int mid=(left+right)>>1;
if(judge(N,mid,L)>=N-M){
ans=mid;
left=mid+1;
}
else {
right=mid-1;
}
}
printf("%d\n",ans);
}
return 0;
}
相关文章推荐
- Linux id 命令
- Linux命令
- find命令
- MyBatis架构设计及源代码分析系列 :MyBatis架构
- 如何让 Tomcat 访问 HBase
- WP Super Cache+七牛云配置CDN加速,让你的网站秒开
- Linux 驱动分类 与访问技术
- Linux 打包 压缩 解压缩 命令
- 让apach 开机自启动
- TopCoder SRM676 Div. 2 Problem 550 - BoardEscapeDiv2
- shell split 字符串 三种方式和效率
- 让你的网站high起来
- 怎么用secureCRT连接Linux
- 优化网站加载速度的14个技巧
- 虚拟机安装CentOS6.3及常见问题总结
- Linux gmp类库的简单使用(二)
- OpenCV笔记(九)
- mysql 5.7.9 Linux安装
- DB2 服务器(WINDOWS) 与客户端 (LINUX) 配置
- 一个简单的多目录makefile