【POJ 3258】River Hopscotch
2015-10-16 23:51
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 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
Sample Output
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).
Source
USACO 2006 December Silver
二分答案+检查。
如何检查???
从起点开始找到一个石块和它的距离大于当前答案,循环+判断即可。
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 9518 | Accepted: 4071 |
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).
Source
USACO 2006 December Silver
二分答案+检查。
如何检查???
从起点开始找到一个石块和它的距离大于当前答案,循环+判断即可。
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int MAXN = 50005; int block[MAXN], l, n, m; bool check(int maxd) { if (maxd > l) return false; int cnt = 0, st = 0, ed; for (; st <= n;) { ed = st + 1; while (block[ed] - block[st] < maxd) { if (ed == n + 1) return false; ++ed; ++cnt; if (cnt > m) return false; } st = ed; } return true; } void binarysearch(int L, int R) { if (L == R - 1) { printf("%d\n", L); return; } int mid = (L + R) >> 1; if (check(mid)) binarysearch(mid, R); else binarysearch(L, mid); } int main() { scanf("%d%d%d", &l, &n, &m); for (int i = 1; i <= n; ++i) scanf("%d", &block[i]); block[0] = 0; block[n + 1] = l; sort(block + 1, block + n + 1); binarysearch(1, 1000000000); return 0; }
相关文章推荐
- opencv3计算变换矩阵getAffineTransform函数和进行仿射变换warpAffine函数
- opencv3霍夫圆变换-HoughCircles函数
- Linux磁盘与文件系统管理
- opencv3标准霍夫变换-HoughLines函数
- 网站架构的目标、评价指标及实现方法和工具
- CPU监控
- 用fiddler+chrome搞定在线学习网站
- windows下快速启动 nginx 和 php-cgi 的两个批处理
- 一般性网站检测方法
- Tomcat 安装
- windows下nginx和php环境的配置
- Linux学习 -- Shell基础 -- Bash基本功能
- 共享内存陷阱和分析
- 一个5年运维工程师的新年回首
- 设置DrawableTop的图片的大小
- mac下安装nginx+php+mysql+xdebug
- 高手自述:运维工程师的13种技能
- TOMCAT 中文URL乱码问题解决
- Opengl Volume Rendering 资料收集
- window下hadoop实现文件追加,上传,下载