poj 3258(二分)
2014-08-09 21:54
148 查看
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 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、 |
AC代码:
#include<iostream> #include<algorithm> using namespace std; int a[500100]; int L,N,M; int judge(int mid){ //判断删除点的个数为多少 int s,i,j; j=s=0; for(i=1;i<=N+1;i++){ //注意终点位置也要加入计算,虽然终点不删除, if(a[i]-a[j]<mid){ //但是如果终点与终点前一个点的距离>=mid的话也不满足条件,故可认为是删除 s++; } else{ j=i; } } if(s>M) return 0; return 1; } int main(){ while(cin>>L>>N>>M){ a[0]=0; a[N+1]=L; for(int i=1;i<=N;i++) cin>>a[i]; sort(a+1,a+N+1); int left,right,ans; left=0; right=L; while(left<=right){ //这里一定要<=,因为输出的是mid。若是最后输出的是right或者left则用<即可 int mid=(left+right)/2; if(judge(mid)){ left=mid+1; ans=mid; } else right=mid-1; } cout<<ans<<endl; } return 0; }
相关文章推荐
- POJ 3258 River Hopscotch 二分查找
- poj 3258 还是二分
- POJ 3258 River Hopscotch (最大化最小值)二分
- River Hopscotch POJ - 3258 (二分)
- POJ题目3258 River Hopscotch(二分最小值最大化)
- poj 3258:River Hopscotch(二分)
- POJ - 3258/USACO - Dec06 Silver/NOIP 2015 - 提高组 River Hopscotch 贪心+二分搜索
- Poj3258 River Hopscotch 二分
- poj 3258 River Hopscotch 二分搜索极值
- poj3258 二分(连续区间求和)
- 【POJ 3258】 River Hopscotch (二分)
- [二分+贪心] POJ 3258 River Hopscotch
- 【POJ】3258 - River Hopscotch 二分->最大化最小值
- 《挑战程序设计竞赛》3.1.1 二分搜索-最大化最小值 POJ1064 2456 3258 3273 3104 3045
- POJ 3258-River Hopscotch(二分+贪心)
- POJ_3258_River_Hopscotch_[NOIP2015]_(二分,最大化最小值)
- poj 3258 二分最小值最大
- POJ 3258:River Hopscotch & POJ 3273:Monthly Expense (二分)
- POJ 3258 River Hopscotch 二分搜索
- poj 3258 River Hopscotch(二分搜索)