USACO1.2.1 Milking Cows(挤牛奶)

最新推荐文章于 2022-01-25 15:40:41 发布

九天神龍

最新推荐文章于 2022-01-25 15:40:41 发布

阅读量1.9k

点赞数 1

分类专栏： USACO 文章标签： USACO 排序模拟

本文链接：https://blog.csdn.net/gs_wxw/article/details/8481521

版权

该博客介绍了USACO竞赛中的1.2.1 Milking Cows问题，内容包括农民挤牛奶的时间列表，以及如何计算最长连续挤奶时间和最长无挤奶时间。提供了三种解题思路：离散化、线段树和标记数组（哈希），并分享了一种排序后扫描的模拟解法代码。

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

Three farmers rise at 5 am each morning and head for the barn to milk three cows. The first farmer begins milking his cow at time 300 (measured in seconds after 5 am) and ends at time 1000. The second farmer begins at time 700 and ends at time 1200. The third farmer begins at time 1500 and ends at time 2100. The longest continuous time during which at least one farmer was milking a cow was 900 seconds (from 300 to 1200). The longest time no milking was done, between the beginning and the ending of all milking, was 300 seconds (1500 minus 1200).

Your job is to write a program that will examine a list of beginning and ending times for N (1 <= N <= 5000) farmers milking N cows and compute (in seconds):