题目描述了一只名为Fred的青蛙需要跳过河中不同大小的石头到达对岸并返回，小石头只能承受一次重量，大石头可以多次使用。目标是最小化青蛙的最大跳跃距离。输入包含测试用例数量T和每个案例的石头信息，包括石头类型（大或小）和位置。输出每个案例中最小化的最大跳跃距离。解题方法可以使用最大流算法。
|
With the increased use of pesticides, the local streams and rivers have become so contaminated that it has become almost impossible for the aquatic animals to survive.
Frog Fred is on the left bank of such a river. N rocks are arranged in a straight line from the left bank to the right bank. The distance between the left and the right bank is D meters. There are rocks of two sizes. The bigger ones can withstand any weight but the smaller ones start to drown as soon as any mass is placed on it. Fred has to go to the right bank where he has to collect a gift and return to the left bank where his home is situated.
He can land on every small rock at most one time, but can use the bigger ones as many times as he likes. H
最低0.47元/天 解锁文章
97
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
