River Hopscotch
River Hopscotch
http://poj.org/problem?id=3258
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 21165 | Accepted: 8791 |
Description
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 Mrocks.
Input
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
Sample Input
25 5 2
2
14
11
21
17
Sample Output
4
Hint
Source
mid设为最短跳跃距离的最大值
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std; int a[];
int L,N,M; bool erfen(int mid){
int sum=;
int tmp=a[];
int i=;
while(i<=N+){
if(a[i]-tmp<mid){
i++;
sum++;
}
else{
tmp=a[i++];
}
}
if(sum>M) return false;
return true;
} int main(){ cin>>L>>N>>M;
for(int i=;i<=N;i++){
cin>>a[i];
}
sort(a+,a+N+);
a[]=,a[N+]=L;
int LL=,RR=L,mid;
while(LL<=RR){
mid=LL+RR>>;
if(erfen(mid)){
LL=mid+;
}
else{
RR=mid-;
}
}
cout<<RR<<endl;
system("pause");
}
最新文章
- C#异常处理性能测试
- c++虚函数和内联构造函数
- 之四:CATransition - 转场动画
- mysql 存储过程简介
- Volley(一 )—— 框架简介
- Dynamics AX 2012 R2 外部程序运行在没有AD的环境(如PDA) 调用AX服务
- Grub2 使用摘记
- ecshop 点购物车弹出提示框
- AtCoder Grand Contest 001
- 在Intellij IDEA或者PhpStorm下用X-debug调试PHP
- Html笔记(四)图像
- APP如何设计才能适配iphone6/plus和iphone5
- 开发者应该避免使用的6个Java功能(转)
- Hortonworks HDP Sandbox定制(配置)开机启动服务(组件)
- BZOJ 2005: [Noi2010]能量采集( 数论 + 容斥原理 )
- Student implements java.io.Serializable
- win10 uwp 拖动控件
- SLAM+语音机器人DIY系列:(四)差分底盘设计——4.底盘ROS驱动开发
- 在Linux系统上安装Oracle数据库
- As 400错