打卡信奥刷题（1273）用C++实现信奥 P2855 [USACO06DEC] River Hopscotch S

P2855 [USACO06DEC] River Hopscotch S

题目描述

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.

奶牛跳房子：从N块石头中移除M块，使得间距最小值最大。

输入格式

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.

输出格式

Line 1: A single integer that is the maximum of the shortest distance a cow has to jump after removing M rocks

输入输出样例 #1

输入 #1

25 5 2
2
14
11
21
17

输出 #1

4

说明/提示

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).

C++实现

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int l,n,m,a[50003],ans;//定义变量
int count(int mid){
	int j=0,x=0;//x记录删去石头数
	for(int i=1;i<=n+1;i++)	{
		if(a[i]-a[j] < mid)
        x++;
		else j=i;//否则移动起点。
	}
	return x;
}
int main(){
	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 left=1,right=l;
	while(left<=right)	{
		int middle=(left+right)/2;
		if(count(middle)<=m) {
		ans=middle;
		left=middle+1;	
		} 
		else right=middle-1;
	}
	printf("%d",ans);//输出
	return 0;
}

后续

接下来我会不断用C++来实现信奥比赛中的算法题、GESP考级编程题实现、白名单赛事考题实现，记录日常的编程生活、比赛心得，感兴趣的请关注，我后续将继续分享相关内容