#include "bits/stdc++.h"
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;
struct SegTree {
int n;
vector<int> t;
void build(vector<int> &a, int v, int tl, int tr) {
if (tl == tr) {
t[v] = a[tl];
} else {
int tm = (tl + tr) / 2;
build(a, v*2, tl, tm);
build(a, 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(vector<int> &a) {
n = sz(a);
t.resize(4*n);
build(a, 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;
vector<int> mn(n), mx(n);
for (int i = 0; i < n; ++i) {
cin >> mn[i] >> mx[i];
}
SegTree seg(mn);
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 |
2 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 |
512 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 |
4 ms |
620 KB |
Output is correct |
2 |
Correct |
3 ms |
748 KB |
Output is correct |
3 |
Correct |
3 ms |
748 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
105 ms |
14188 KB |
Output is correct |
2 |
Correct |
98 ms |
16236 KB |
Output is correct |
3 |
Correct |
101 ms |
18156 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
229 ms |
27884 KB |
Output is correct |
2 |
Correct |
196 ms |
30340 KB |
Output is correct |
3 |
Execution timed out |
1076 ms |
30444 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
257 ms |
33908 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
310 ms |
39432 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1084 ms |
36076 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
140 ms |
24684 KB |
Output is correct |
2 |
Correct |
140 ms |
25196 KB |
Output is correct |
3 |
Correct |
138 ms |
24940 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
181 ms |
23300 KB |
Output is correct |
2 |
Correct |
147 ms |
26092 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
222 ms |
32236 KB |
Output is correct |
2 |
Execution timed out |
1062 ms |
43276 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
222 ms |
31212 KB |
Output is correct |
2 |
Execution timed out |
1090 ms |
38764 KB |
Time limit exceeded |