poj 3258 River Hopscotch(二分最大化最小值)
来源:互联网 发布:mac cd 到u盘 编辑:程序博客网 时间:2024/06/04 08:51
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 Mrocks (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 ofM rocks.
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 2214112117
Sample Output
4
Hint
#include<cstdio>#include<iostream>#include<algorithm>using namespace std;const int maxn = 5 * 1e5 + 10;int d[maxn];int L , n , m ;int judge(int o){ int cnt = 0; int last = 0; for(int i = 1 ; i <= n+1 ; i++) { if(d[i] < last + o){ cnt++; } else last = d[i]; } return cnt ;}int main(){ while(~scanf("%d%d%d",&L,&n,&m)) { for(int i = 1 ; i <= n ; i++) scanf("%d",&d[i]); sort(d+1,d+n+1); d[n+1] = L; int ans = 0; int l = 1 , r = L; while(l <= r) { int mid = (l + r) / 2; if(judge(mid) > m) { r = mid - 1; } else l = mid + 1; } printf("%d\n",l - 1); } return 0;}
- POJ 3258 River Hopscotch (二分,最大化最小值)
- POJ 3258 River Hopscotch【二分:最大化最小值】
- POJ - 3258 River Hopscotch(二分搜索:最大化最小值)
- [ACM] POJ 3258 River Hopscotch (二分,最大化最小值)
- [ACM] POJ 3258 River Hopscotch (二分,最大化最小值)
- poj 3258 River Hopscotch 【二分查找(最大化最小值)】
- POJ题目3258 River Hopscotch(二分最小值最大化)
- POJ 3258 River Hopscotch(贪心+二分查找 最大化最小值)
- POJ 3258 River Hopscotch (最大化最小值)二分
- poj 3258 River Hopscotch(二分最大化最小值)
- poj 3258 River Hopscotch (最小值最大化 二分+贪心)
- POJ 3258 River Hopscotch(最大化最小值)
- poj 3258 River Hopscotch (二分搜索---最大化最小值)
- POJ 3258 River Hopscotch(二分搜索,最大化最小值)
- POj 3258 River Hopscotch 二分搜索 最大化最小值
- poj--3258 River Hopscotch(最大化最小值)
- 【贪心专题】POJ 3258 River Hopscotch (最大化最小值 贪心+二分搜索)
- poj 3258 River Hopscotch(二分法,最小值最大化)
- 怎么成为一个微信开发者
- 动态规划背包问题
- 在SqlServer中,教你如何修改列名
- [leetcode] 257. Binary Tree Paths
- DialogFragment对话框(二) ——Fragment和Activity的通信
- poj 3258 River Hopscotch(二分最大化最小值)
- Linux常用命令全解
- Spring Boot:在Spring Boot中使用定时任务
- vim中:wq和:x的区别
- 【HDU】5256 - 序列变换(LIS)
- Java文件读写操作
- Gson解析Map格式json数据
- hdu 5762 Teacher Bo(vector的使用1)
- MVC _ViewStart.cshtml文件