ZJNU 1898 Cow Dance Show 二分

最新推荐文章于 2021-11-02 18:51:28 发布

-Atlantis-

最新推荐文章于 2021-11-02 18:51:28 发布

阅读量518

点赞数

分类专栏：二分文章标签： Cow-Dance

本文链接：https://blog.csdn.net/enamor_AC/article/details/60340433

版权

这是一道关于计算最小舞台数量的编程题，要求在不超过特定时间Tmax的情况下，使得所有牛都能完成舞蹈。每头牛的舞蹈时间不同，当一头牛完成舞蹈后，下一头牛立即接替上场。通过二分查找方法，找到满足条件的最小舞台数。

摘要由CSDN通过智能技术生成

Cow Dance Show

Time Limit: 3000MS Memory Limit: 3000K
Total Submissions: 82 Accepted: 13
Description

After several months of rehearsal, the cows are just about ready to put on their annual dance performance; this year they are performing the famous bovine ballet “Cowpelia”.

The only aspect of the show that remains to be determined is the size of the stage. A stage of size K can support K cows dancing simultaneously. The N cows in the herd (1≤N≤10,000) are conveniently numbered 1…N in the order in which they must appear in the dance. Each cow ii plans to dance for a specific duration of time d(i)d(i). Initially, cows 1…K appear on stage and start dancing. When the first of these cows completes her part, she leaves the stage and cow K+1 immediately starts dancing, and so on, so there are always K cows dancing (until the end of the show, when we start to run out of cows). The show ends when the last cow completes her danci