【POJ】River Hopscotch
来源:互联网 发布:windows一键还原按什么 编辑:程序博客网 时间:2024/06/07 10:13
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 toM 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
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647
#include<cstdio>#include<algorithm>#include<cstdlib>int l,n,m,a[50000];using namespace std;bool judge(int mid){int t=0,j=0;for(int i=1;i<=n+1;i++){if(a[i]-a[j]<mid) { t++;//记录减去的点数 if(t>m)//去掉的点数大于m,则不合适,舍去 return false; } else j=i;}return true;}int main(){while(~scanf("%d%d%d",&l,&n,&m)){for(int i=1;i<=n;i++)scanf("%d",&a[i]);sort(a+1,a+n+1);a[0]=0;a[n+1]=l;int ans;int k=0,r=l;while(k<=r){int mid=(r-k)/2+k;//注意取后半区间 ,不能用(r+k)/2if(judge(mid)){ans=mid;k=mid+1;//mid偏小 ,尽量往大的取,所以选后半区间 }elser=mid-1;}printf("%d\n",ans);}return 0; }
- poj 3258 River Hopscotch
- Dichotomy poj 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
- POJ 3258 River Hopscotch
- POJ 3258 River Hopscotch
- POJ 3258--River Hopscotch
- JSON和XML解析的理解
- linux中如何查看日志中某个异常出现的次数
- Android多线程断点续传实现总结
- Centos 源码安装 MySQL
- Struts2之文件上传
- 【POJ】River Hopscotch
- JQ中的attr和prop方法
- 160726Java学习
- 正则表达式(regular expression)以及常用语法
- Android滑动效果是如何产生的
- C 语言资源大全中文版
- netstat 查看TCP网络连接情况
- SQL InnoDB 共享表空间和独立表空间
- env: /etc/init.d/redis: Permission denied