poj3258River Hopscotch【二分】
来源:互联网 发布:通天塔 网络政治效应 编辑:程序博客网 时间:2024/05/16 05:02
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
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>using namespace std;int num[500010];int judge(int n,int m,int L){int l=0,ans=0;for(int i=0;i<n;++i){if(num[i]-l>=m){if(L-num[i]<m)break;ans++;l=num[i];}}return ans;}int main(){int N,L,M,i,j,k;while(scanf("%d%d%d",&L,&N,&M)!=EOF){for(i=0;i<N;++i){scanf("%d",&num[i]);}sort(num,num+N);int left=0,right=L,ans;while(left<=right){int mid=(left+right)>>1;if(judge(N,mid,L)>=N-M){ans=mid;left=mid+1;}else {right=mid-1;}}printf("%d\n",ans);}return 0;}
- poj3258River Hopscotch(二分)
- poj3258River Hopscotch【二分】
- poj3258River Hopscotch(二分)
- POJ3258River Hopscotch
- poj3258River Hopscotch
- POJ3258 River Hopscotch二分
- POJ3258:River Hopscotch(二分)
- River Hopscotch(二分POJ3258)
- poj3258 River Hopscotch(二分)
- POJ3258-River Hopscotch二分
- River Hopscotch(二分)
- River Hopscotch--二分答案
- Poj3258 River Hopscotch 二分
- POJ3258 River Hopscotch 二分
- River Hopscotch [二分]
- POJ 3258 River Hopscotch 二分
- POJ 3258 River Hopscotch 二分
- poj-3258-River Hopscotch-二分
- 卡特兰数
- hdoj--1237--简单计算器(栈模拟)
- PHP的异步并行网络扩展swoole如何使用
- Linux id 命令
- [Oracle数据库] oracle数据库字符集characterset迁移及变更之csscan及csalter.plb系列三
- poj3258River Hopscotch【二分】
- 一个获得更多细节的前景分割算法,比OTSU获得更多细节。
- poj2777Count Color(线段树)
- Repository模式
- java学习笔记-foreach与iterator
- 10个Android开源个性化View控件
- LINUX 下LAMP之yum方法部署环境
- ClassLoader.getResourceAsStream() 与 Class.getResourceAsStream()的区别
- 对国产操作系统发展的一些思考