#include "bits/stdc++.h"
#pragma GCC optimize("unroll-loops", "Ofast")
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
using ll = long long;
const int mod = 1e9+7;
const int mxN = 1e6;
int mn[mxN], mx[mxN];
struct SegTree {
int n;
int t[mxN * 4];
void build(int v, int tl, int tr) {
if (tl == tr) {
t[v] = mn[tl];
} else {
int tm = (tl + tr) / 2;
build(v*2, tl, tm);
build(v*2+1, tm+1, tr);
t[v] = max(t[v*2], t[v*2+1]);
}
}
int query(int v, int tl, int tr, int l, int r) {
if (l > r) return -1e9;
if (l == tl and r == tr) return t[v];
int tm = (tl + tr) / 2;
return max(query(v*2, tl, tm, l, min(r, tm)), query(v*2+1, tm+1, tr, max(l, tm+1), r));
}
SegTree(int _n) {
n = _n;
build(1, 0, n-1);
}
int query(int l, int r) {
return query(1, 0, n-1, l, r);
}
};
void solve(int tc) {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> mn[i] >> mx[i];
}
SegTree seg(n);
int lo = 0, hi = n-1;
int m = -1e9;
int ans = 0;
for (int i = 0; i < n; ++i) {
if (mx[i] < m) {
++lo;
hi = i;
while (lo < hi) {
int mid = (lo + hi) / 2;
int q = seg.query(mid, i);
if (mx[i] < q) lo = mid+1;
else hi = mid;
}
m = seg.query(lo, i);
}
m = max(m, mn[i]);
ans = max(ans, i - lo + 1);
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int tc = 1;
//cin >> tc;
for (int i = 1; i <= tc; ++i) solve(i);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
620 KB |
Output is correct |
2 |
Correct |
4 ms |
620 KB |
Output is correct |
3 |
Correct |
4 ms |
620 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
94 ms |
8044 KB |
Output is correct |
2 |
Correct |
81 ms |
8556 KB |
Output is correct |
3 |
Correct |
96 ms |
13164 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
190 ms |
14316 KB |
Output is correct |
2 |
Correct |
166 ms |
14700 KB |
Output is correct |
3 |
Execution timed out |
1098 ms |
14828 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
226 ms |
14572 KB |
Output is correct |
2 |
Correct |
174 ms |
14956 KB |
Output is correct |
3 |
Execution timed out |
1100 ms |
14956 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
266 ms |
15596 KB |
Output is correct |
2 |
Correct |
173 ms |
15084 KB |
Output is correct |
3 |
Execution timed out |
1101 ms |
16364 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1083 ms |
14956 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
130 ms |
14956 KB |
Output is correct |
2 |
Correct |
134 ms |
15084 KB |
Output is correct |
3 |
Correct |
134 ms |
15084 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
156 ms |
14572 KB |
Output is correct |
2 |
Correct |
137 ms |
15212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
236 ms |
14188 KB |
Output is correct |
2 |
Execution timed out |
1094 ms |
16092 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
200 ms |
14060 KB |
Output is correct |
2 |
Execution timed out |
1088 ms |
15212 KB |
Time limit exceeded |