POJ River Hopscotch 二分搜索
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 2
2
14
11
21
17
Sample Output
4
Hint
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
#include<map>
#include<string>
using namespace std;
#define MAXN 50001
#define INF 0x3f3f3f3f
/*
在一个有序序列中移除M个元素:
求元素之间最短距离最大能增大多少
先求出当前最短距离
二分查找当前最短-最终最短 找到通过移除M个元素最大的最短距离
关键还是check函数 在移除M个情况下,最短跳跃x能否到达终点
*/
int a[MAXN], L, n, m, tmp;
bool check(int mid)
{
int i, before = , cnt = ;
for (i = ; i <= n + ; i++)
{
if (a[i] - a[before] >= mid)//这块用于判断是否去掉石头
{
before = i;
}
else
{
cnt++;
if (cnt > m)
return false;
}
}
return true;
}
int main()
{
while (scanf("%d%d%d", &L, &n, &m) != EOF)
{
a[] = ;
for (int i = ; i < n; i++)
{
scanf("%d", &a[i]);
}
a[n+] = L;
sort(a, a + n+);
int beg = , end = L*,ans = ;
while (beg <= end)
{
int mid = (beg + end) / ;
if (check(mid))
{
ans = mid;
beg = mid + ;
}
else
end = mid - ;
}
printf("%d\n", ans);
}
return ;
}
最新文章
- CSS Shake – 摇摆摇摆!动感的 CSS 抖动效果
- svg-filter高斯模糊
- Ganglia安装扩容
- ubuntu在命令行新建用户后无法进入桌面的原因
- Google搜索的几个使用技巧——让你的搜索结果更准确
- ubuntu 使用adb shell命令识别android设备
- SQL Server :DBLINK创建及使用
- JSP文件下载时文件名在ie和firefox下面文件名不一致极其超链接中文乱码的问题的改进
- 【转】C/C++中可变参数函数的实现
- siem主流厂商
- Selenium2(java)定位页面元素 二
- nginx 部署
- MicroPython+北斗+GPS+GPRS:TPYBoardv702短信功能使用说明
- 面向对象___str__和__repr__
- Charles篡改后台数据
- Kettle实现数据抽取、转换、装入和加载数据-数据转移ETL工具
- 转://SQL PROFILE
- ActiveSupport::Concern 和 gem &#39;name_of_person&#39;(300✨) 的内部运行机制分析
- flask-系统介绍及环境搭建1
- day7-python打开文件方式