博客介绍了如何解决CodeForces的一道算法题，涉及到二分查找和贪心策略。农夫约翰在旅店预订房间，希望与最远的牛之间的距离最小。题目解析了如何通过二分查找确定连续空房间的起始位置，再用贪心策略找到中间位置，以达到最小距离。并提供了题意、思路及代码实现。
提交链接：CF 645C
题面：
C. Enduring Exodus
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
In an attempt to escape the Mischievous Mess Makers' antics, Farmer John has abandoned his farm and is traveling to the other side of Bovinia. During the journey, he and his k cows have decided to stay at the luxurious Grand Moo-dapest Hotel. The hotel consists of n rooms located in a row, some of which are occupied.
Farmer John wants to book a set of k + 1 currently unoccupied rooms for him and his cows. He wants his cows to stay as safe as possible, so he wishes to minimi
最低0.47元/天 解锁文章
633
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
