0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-09-20 04:25:25 +00:00

P1204 [USACO1.2] 挤牛奶 Milking Cows

R43297287
This commit is contained in:
Baoshuo Ren 2020-12-06 14:49:50 +08:00 committed by Baoshuo Ren
parent b37c8f2460
commit 5da0d0d37e
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

40
problem/P1204/P1204.cpp Normal file
View File

@ -0,0 +1,40 @@
#include <bits/stdc++.h>
using namespace std;
struct node {
int start, end;
bool operator<(node b) {
return start < b.start;
}
node() {
start = end = 0;
}
} a[5005];
int main() {
int n, start, end, ans1 = 0, ans2 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i].start >> a[i].end;
}
sort(a, a + n);
start = a[0].start;
end = a[0].end;
for (int i = 1; i < n; i++) {
if (a[i].start <= end) {
end = max(end, a[i].end);
}
else {
ans1 = max(ans1, end - start);
ans2 = max(ans2, a[i].start - end);
start = a[i].start;
end = a[i].end;
}
}
ans1 = max(ans1, end - start);
cout << ans1 << ' ' << ans2 << endl;
return 0;
}