#include <iostream>
#include <cstring>
#include <algorithm>
#define x first
#define y second
using namespace std;
typedef pair<int, int> PII;
const int N = 5010;
int n;
PII segs[N];
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i ++ ) scanf("%d%d", &segs[i].x, &segs[i].y);
sort(segs, segs + n);
int res1 = 0, res2 = 0;
int l = segs[0].x, r = segs[0].y;
for (int i = 1; i < n; i ++ )
if (segs[i].x <= r) r = max(r, segs[i].y);
else
{
res1 = max(res1, r - l);
res2 = max(res2, segs[i].x - r);
l = segs[i].x, r = segs[i].y;
}
res1 = max(res1, r - l);
printf("%d %d\n", res1, res2);
return 0;
}
AcWing 1343. 挤牛奶 区间合并
最新推荐文章于 2024-07-25 21:11:40 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)