AcWing 1343. 挤牛奶
原题链接
简单
作者:
Jacky.C
,
2021-01-16 22:26:22
,
所有人可见
,
阅读 410
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
vector<pair<int,int>> t;
int main()
{
int n,x,y;
cin>>n;
for(int i = 0; i<n; i++){
cin>>x>>y;
t.push_back({x,y});
}
sort(t.begin(), t.end());
int l = t[0].first, r = t[0].second;
int mx = r-l, mi = 0;
for(int i = 1; i<n; i++){
if(t[i].first <= r){
r = max(r, t[i].second);
}else{
mx = max(mx, r - l);
mi = max(mi, t[i].first - r);
l = t[i].first, r = t[i].second;
}
}
mx = max(mx, r-l);
mi = max(mi, t[n-1].first - r);
cout<<mx<<' '<<mi<<endl;
return 0;
}