题目:有一只青蛙要去对岸找东西然后返回,因为河水被污染了,所以只能踩着石头过河,
石头有两种:B石头可以无限次使用,S石头使用一次就沉下去了,计算一个路径,
使得最长的跳跃距离最小。
分析:贪心,二分。二分最大长度,利用贪心判定是否可以跳过去再回来。
设计贪心策略(最大跳跃距离为L时):
1.如果L距离内有B石头,则跳上去,以它作为起点,所以可以按B进行分段计算;
(证明:如果有B石头,只会减少跳跃距离)
2.如果没有B石头,则跳到L距离内最远的S石头上;
(证明:设去和回的路径为F=【Bk,Si,Si+1,..,Bk+1】,B=【Bk,Sj,Sj+1,..Bk+1】
可知Si > Sj,此时交换Si与Sj,则B成立,Si到Sj+1距离可能超过L,因此Si优于Sj)
说明:(⊙v⊙)。
#include <stdio.h>
#include <stdlib.h>
char stone_type[111];
int stone_dist[111];
int stone_down[111];
int can_jump(int N, int L)
{
for (int i = 0; i <= N+1; ++ i) {
stone_down[i] = 0;
}
int forward = 0;
while (forward <= N) {
int start = forward;
while (forward <= N && stone_dist[forward+1] - stone_dist[start] <= L) {
forward ++;
if (stone_type[forward] == 'B') {
break;
}
}
if (start == forward) {
return 0;
}
if (stone_type[forward] == 'S') {
stone_down[forward] = 1;
}
}
int back = N+1;
while (back >= 1) {
int start = back;
while (back >= 1 && stone_dist[start] - stone_dist[back-1] <= L) {
back --;
if (stone_type[back] == 'B') {
break;
}
while (stone_down[back]) {
back --;
}
}
if (stone_dist[start] - stone_dist[back] > L) {
back ++;
while (stone_down[back]) {
back ++;
}
}
if (start <= back) {
return 0;
}
}
return 1;
}
int main()
{
int T, N, D;
char buf[80];
while (~scanf("%d",&T)) {
for (int t = 1; t <= T; ++ t) {
scanf("%d%d",&N,&D);
for (int i = 1; i <= N; ++ i) {
scanf("%s",buf);
sscanf(buf,"%c-%d",&stone_type[i],&stone_dist[i]);
}
stone_type[0] = 'B';
stone_dist[0] = 0;
stone_type[N+1] = 'B';
stone_dist[N+1] = D;
int L = 0, R = D, Mid;
while (L < R) {
Mid = (L+R)/2;
if (can_jump(N, Mid)) {
R = Mid;
}else {
L = Mid+1;
}
}
printf("Case %d: %d\n",t,L);
}
}
return 0;
}