usaco Milking Cows (贪心)
来源:互联网 发布:24小时私人网络上借钱 编辑:程序博客网 时间:2024/04/30 03:07
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.
PROGRAM NAME: milk2
INPUT FORMAT
Line 1:The single integer, NLines 2..N+1:Two non-negative integers less than 1,000,000, respectively the starting and ending time in seconds after 0500SAMPLE INPUT (file milk2.in)
3300 1000700 12001500 2100
OUTPUT FORMAT
A single line with two integers that represent the longest continuous time of milking and the longest idle time.SAMPLE OUTPUT (file milk2.out)
900 300
题意:给出几个线段,求覆盖长度最值,和不被覆盖到的最值(连续的)。
给头端点进行排序,维护尾节点。
/** PROG:milk2 LANG:C++ ID:zpc19951 **/#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;pair<int,int>a[5555];int main(){freopen("milk2.in","r",stdin);freopen("milk2.out","w",stdout);int pre,last,ans,i,j,n,ans2;scanf("%d",&n);for(i=0;i<n;i++) scanf("%d%d",&a[i].first,&a[i].second);sort(a,a+n);pre=a[0].first;last=a[0].second;ans=last-pre;ans2=0;for(i=1;i<=n;i++) {if(a[i].first<=last) last=max(last,a[i].second);else {ans2=max(ans2,a[i].first-last);pre=a[i].first;last=a[i].second;}ans=max(ans,last-pre);}printf("%d %d\n",ans,ans2);return 0;}
- usaco Milking Cows (贪心)
- USACO-Section 1.2 Milking Cows【贪心算法】
- Milking Cows(USACO)
- USACO 1.2-Milking Cows
- usaco 1.2:Milking Cows
- [USACO] Milking Cows
- usaco Milking Cows
- USACO 1.2 Milking Cows
- [USACO]Milking Cows
- usaco Milking Cows 报告
- usaco:Milking Cows
- USACO-Milking Cows
- USACO--1.2 Milking Cows
- USACO 1.2 Milking Cows
- USACO Milking Cows
- USACO Milking Cows
- USACO Milking Cows(模拟)
- USACO Milking Cows(greedy)
- ARM寄存器介绍
- bzoj 2002 [Hnoi2010]Bounce 弹飞绵羊 [分块][特殊处理]
- 将sublime text3添加到右键菜单中(可执行)
- oracle中case when then及decode用法
- 责任链模式
- usaco Milking Cows (贪心)
- NOIP2015 写后感
- C# & WPF 随手小计之一 ——初探async await 实现多线程处理
- bzoj 3926 [Zjoi2015]诸神眷顾的幻想乡 后缀自动机
- hdu 2181:哈密顿绕行世界问题(dfs)
- CATransform3D 特效详解
- 命令模式
- 16.10.28
- help 通用html 1.0版