POJ 3258 River Hopscotch【二分：最大化最小值】

最新推荐文章于 2021-03-04 00:05:25 发布

Puya

最新推荐文章于 2021-03-04 00:05:25 发布

阅读量353

点赞数

分类专栏： POJ 挑战程序设计—中级篇

本文链接：https://blog.csdn.net/Puyar_/article/details/73799716

版权

POJ 同时被 2 个专栏收录

30 篇文章 0 订阅

订阅专栏

挑战程序设计—中级篇

12 篇文章 0 订阅

订阅专栏

Language:

River Hopscotch

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 13769		Accepted: 5855

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 D_i from the start (0 < D_i < 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

Sample Output

就相当于把（n-k+1)块石头放入给出的位置，求最大化最小值

#include<iostream>  
#include<cstdio>  
#include<cstring>  
#include<string>  
#include<cmath>  
#include<queue>  
#include<stack>  
#include<vector>  
#include<map>  
#include<algorithm>  
using namespace std;  
#define ll long long  
#define ms(a,b)  memset(a,b,sizeof(a))  
const int M=1e5+10;  
const int inf=0x3f3f3f3f;  
const int mod=1e9+7; 
int i,j,k,n,m; 
int a[M]; 
int b[M];
double y[M];

bool check(int mid)
{
	int last=0;
	for(int i=0;i<n-k+1;i++){
		int cur=last+1;
	 while(cur<=n+1&&a[cur]-a[last]<mid)cur++;
	 if(cur>n+1)return false;
	 last=cur;
	}
	return true;
}
int main()
{
	int L;
	while(~scanf("%d%d%d",&L,&n,&k)){
		for(int i=1;i<=n;i++)
			scanf("%d",&a[i]);
		a[0]=0,a[n+1]=L;
		sort(a,a+n+1);
		int lb=0,ub=L+10;
		while(ub-lb>1){
			int mid=(lb+ub)/2;
			if(check(mid))lb=mid;
			else ub=mid;
		}
		printf("%d\n",lb);
	}
	return 0;
}