[poj 2376] Cleaning Shifts [最小区间覆盖贪心]

最新推荐文章于 2022-09-03 23:09:32 发布

真·skysys

最新推荐文章于 2022-09-03 23:09:32 发布

阅读量603

点赞数 1

分类专栏：算法与数学文章标签： poj 最小区间覆盖问题

请明确标注出处

本文链接：https://blog.csdn.net/qq_33583069/article/details/51970514

版权

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

469 篇文章 58 订阅 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

该博客介绍了如何解决POJ 2376问题，即如何分配清洁任务给奶牛，使得每个时间段都有至少一头奶牛工作，并使参与清洁的奶牛数量最小。题目提供了输入输出示例，强调了大输入数据的处理，提示使用scanf()代替cin。博主给出了覆盖所有时间段的最小奶牛数量解法。

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

Cleaning Shifts
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 17550 Accepted: 4470

Description
Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has divided the day into T shifts (1 <= T <= 1,000,000), the first being shift 1 and the last being shift T.

Each cow is only available at some interval of times during the day for work on cleaning. Any cow that is selected for cleaning duty will work for the entirety of her interval.

Your job is to help Farmer John assign some cows to shifts so that (i) every shift has at least one cow assigned to it, and (ii) as few cows as possible are

了解本专栏