이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<ll,ll>> v(n);
for(int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
int ans = 0;
for(int i = 0; i < n; i++) {
ll mx = -1e18;
for(int j = i; j < n; j++) {
if(v[j].second >= mx) {
ans = max(ans, j - i + 1);
mx = max(mx, v[j].first);
}
else break;
}
}
// int j = 0;
// multiset<int> s;
// int ans = 0;
// for(int i = 0; i < n; i++) {
// j = max(j, i);
// while(j < n && (s.empty() || v[j].second >= -(*s.begin()))) {
// s.insert(-v[j].first);
// j++;
// }
// ans = max(ans, j - i);
// s.erase(-v[i].first);
// }
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |