codeforces 671B ／Round #352(div.2) D.Robin Hood 二分

真·skysys

于 2016-07-20 09:27:06 发布

阅读量619

点赞数 1

分类专栏：算法与数学文章标签：二分 codeforces

请明确标注出处

本文链接：https://blog.youkuaiyun.com/qq_33583069/article/details/51965219

版权

算法与数学专栏收录该内容

469 篇文章 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

博客探讨了Codeforces Round #352(div.2) D题‘Robin Hood’，其中描述了一个关于富人和穷人之间转移硬币的问题。在Robin Hood退休前的k天里，他每天会从最富的人那里拿一枚硬币给最穷的人。文章介绍了如何通过二分查找算法来确定经过k天后，最富和最穷者之间的财富差距。示例和解析帮助理解题目的运作机制和解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

D. Robin Hood

We all know the impressive story of Robin Hood. Robin Hood uses his archery skills and his wits to steal the money from rich, and return it to the poor.

There are n citizens in Kekoland, each person has ci coins. Each day, Robin Hood will take exactly 1 coin from the richest person in the city and he will give it to the poorest person (poorest person right after taking richest’s 1 coin). In case the choice is not unique, he will select one among them at random. Sadly, Robin Hood is old and want to retire in k days. He decided to spend these last days with helping poor people.

After taking his money are taken by Robin Hood richest person may become poorest person as well, and it might even happen that Robin Hood will give his money back. For example