POJ3258-River Hopscotch
来源:互联网 发布:windows 2000 编辑:程序博客网 时间:2024/06/13 01:15
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, Lunits 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
题意:有一条L长的河,沿河有n块石头,河的两端还有两块不能动的石头,让你去掉m块石头,问两两石头之间的最短距离最大能是多少
解题思路:二分最短距离,验证时可以用stack,当这块石头与栈顶石头的距离大于二分距离,则将这块石头压入,否则去掉这块石头
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <cmath>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF=0x3f3f3f3f;int a[50009];int L,n,m;bool check(int k){ int cnt=0; stack<int>s; s.push(0); for(int i=1;i<=n;i++) { if(a[i]-s.top()>=k) s.push(a[i]); else cnt++; } while(a[n+1]-s.top()<k&&s.size()>1) cnt++,s.pop(); if(cnt<=m) return 1; else return 0;}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+1+n); a[n+1]=L; int ans=INF; for(int i=1;i<=n+1;i++) ans=min(ans,a[i]-a[i-1]); int l=0,r=L; while(l<=r) { int mid=(l+r)>>1; if(check(mid)) {l=mid+1,ans=mid;} else r=mid-1; } printf("%d\n",ans); }return 0;}
- POJ3258:River Hopscotch
- POJ3258-River Hopscotch
- POJ3258--River Hopscotch
- poj3258 River Hopscotch
- POJ3258 River Hopscotch二分
- POJ3258:River Hopscotch(二分)
- POJ3258 River Hopscotch
- 贪心 - poj3258 River Hopscotch
- POJ3258-- River Hopscotch
- River Hopscotch(二分POJ3258)
- POJ3258--------River Hopscotch
- poj3258 River Hopscotch(二分)
- 【NOIP2015TGD2T1】poj3258 River Hopscotch
- POJ3258 River Hopscotch
- POJ3258 River Hopscotch
- POJ3258-River Hopscotch
- POJ3258-River Hopscotch二分
- 【二分法】POJ3258-River Hopscotch
- 多态和虚方法的调用
- 多功能串口调试工具的初步设想
- HDU-2955(01背包)
- 最小二乘解(Least-squares Minimization )
- Struts1框架五之怎么自定义一个FormBean的类型转化器
- POJ3258-River Hopscotch
- Android 添加多张图片。
- Struts1框架七之DispatchAction的说明
- 关于广义表
- GDI波形图的绘制以及坐标系的添加
- JZOJ2413 【NOI2005】维护数列
- MySQL基本操作
- 【JavaSE系列-入门篇4】——使用NetBeans IDE创建Hello World 应用程序
- 函数指针与回调函数