POJ 3258 River Hopscotch(二分·最小距离最大)
来源:互联网 发布:网络信号监控下载 编辑:程序博客网 时间:2024/05/29 13:14
题意 一条河两岸之间有n个石头 求取走m个石头后 使得两个石头间距离的最小值最大
感觉关键是理解题意 简单的二分 二分最小距离 看要取走多少个(cnt)石头 cnt<=m的话 说明最小距离还可以增大 这样就可以二分出答案了
#include <cstdio>#include <algorithm>using namespace std;const int N = 50005;int p[N], l, n, m;bool ok(int k){ int last = 0, cnt = 0; for(int i = 1; i < n; ++i) { if(p[i] - p[last] < k) ++cnt; else last = i; } return cnt <= m;}int main(){ int le, ri, mid; while(~scanf("%d%d%d", &l, &n, &m)) { p[++n] = l; for (int i = 1; i < n; ++i) scanf("%d", &p[i]); sort(p, p + n); le = 0, ri = l; while(le <= ri) { mid = (le + ri) >> 1; if(ok(mid)) le = mid + 1; else ri = mid - 1; } printf("%d\n", le - 1); } return 0;}
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 M 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
Source
- POJ 3258 River Hopscotch(二分·最小距离最大)
- POJ 3258 River Hopscotch(二分·最小距离最大)
- POJ 3258 River Hopscotch(二分求最小中的最大)
- POJ 3258 River Hopscotch 二分
- POJ 3258 River Hopscotch 二分
- poj-3258-River Hopscotch-二分
- River Hopscotch - POJ 3258 二分
- 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
- poj2549 Sumsets(折半枚举)
- jquery单页锚点移动
- 11-面试题总结2015年3月9日第一发
- SSH框架下载路径
- pulltorefresh(二)的自定义属性介绍、attrs文件介绍
- POJ 3258 River Hopscotch(二分·最小距离最大)
- Android 4主线程访问网络
- Netty百万级推送服务设计要点
- MFC工具栏将位图分隔为图标的问题
- maximo系统任务集成
- LeetCode Min Stack
- STL map中key为结构体的用法
- 设计模式 观察者模式 以微信公众服务为例
- Hive 连接函数 concat