1343. 挤牛奶(区间和并)
作者:
方攵飛夢想
,
2022-12-01 21:15:37
,
所有人可见
,
阅读 131
#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define int long long
typedef pair<int, int> PII;
const int N = 5010;
PII seg[N];
signed main()
{
int n;
cin >> n;
for(int i = 0; i < n; i++) cin >> seg[i].x >> seg[i].y;
sort(seg, seg + n);
int res1 = 0, res2 = 0;
int l = seg[0].x, r = seg[0].y;
for(int i = 1; i < n; i++)
{
if(seg[i].x <= r)
{
r = max(r, seg[i].y);
}
else
{
res1 = max(res1, r - l);
res2 = max(res2, seg[i].x - r);
l = seg[i].x, r = seg[i].y;
}
}
res1 = max(res1, r - l);
cout << res1 << ' ' << res2 << endl;
return 0;
}