POJ3258(最大化最小值)
2016-07-17 14:21
399 查看
River Hopscotch
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 distanceDi 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
Sample Output
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 11155 | Accepted: 4785 |
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 distanceDi 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
#include <cstdio> #include <algorithm> using namespace std; const int MAXN=50005; int l,n,m; int x[MAXN]; bool test(int d) { int cnt=0; int last=0; for(int i=0;i<n;i++) { if(x[i]-last<d) { cnt++; continue; } last=x[i]; } if(l-last<d) return false; return cnt<=m; } int main() { while(scanf("%d%d%d",&l,&n,&m)!=EOF) { for(int i=00;i<n;i++) { scanf("%d",&x[i]); } sort(x,x+n); int l=0,r=0x3f3f3f3f; while(r-l>1) { int mid=(l+r)>>1; if(test(mid)) { l=mid; } else { r=mid; } } printf("%d\n",l); } return 0; }
相关文章推荐
- MediaPlayerManager
- Android Studio 构建项目一直卡在 gradle build running 解决方法
- [暑假集训] jzoj 2016.7.17 noip模拟赛C&B 总结
- genymotion 启动模拟器"unable to start the virtual device"问题解决
- gulp + browserSync 一起提高前端开发效率吧!
- jzoj 1365. 【队列练习】奇怪的电梯
- 深入浅出 RecyclerView
- css3学习以及移动端开发基本概念的思考
- hihocoder-平衡树·SBT
- 利用 libevent 实现简单 http client GET、POST
- handler浅谈
- HTML iframe 用法小总结
- linux系统中怎么结束boa进程?
- gcc选项 -D_REENTRANT机制
- 晃动动画加震动
- jzoj 1591. 【普及模拟】游戏
- listView分页加载
- 根据观测时间,经纬度,求太阳高度角
- win7 vi工具
- cccc