/*
ID: m1871091
LANG: C++11
TASK: milk2
*/
#define _CRT_SECURE_NO_WARNINGS
#define local
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
pair<int, int> a[5005];
int main(){
#ifdef local
freopen("milk2.in", "r", stdin);
freopen("milk2.out", "w", stdout);
#endif // local
int n;
cin >> n;
for (int i = 0; i < n; i++){
cin >> a[i].first>>a[i].second;
}
sort(a, a + n);
int maxn1=a[0].second-a[0].first, maxn2=0 ,end=a[0].second;
int m = maxn1;
for (int i = 1; i < n; i++){
if (a[i].first>end){
maxn2 = max(maxn2, a[i].first - end);
end = a[i].second;
maxn1 = max(m, maxn1);
m = a[i].second - a[i].first;
}
else if (a[i].second > end){
m += a[i].second - end;
end = a[i].second;
}
}
maxn1 = max(maxn1, m);
cout << maxn1 <<" "<< maxn2 << endl;
return 0;
}
Milking Cows
最新推荐文章于 2019-03-01 20:55:57 发布