Milking Cows
问题描述
Milking Cows
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):
- The longest time interval at least one cow was milked.
- The longest time interval (after milking starts) during which no cows were being milked.
农民挤奶牛,每个农民有各自的挤奶时间段
求至少有一名农民在挤奶的最长连续时间段
求没有一个农民在挤奶的最长时间间隔
暴力法
思路分析
维护一个标记数组
求此数组标记为True的最大连续区间
求此数组标记为False的最大连续区间