#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 1e6 + 5;
int n, mn, mx, ans, x;
deque<pair<int, int>> dq;
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 0; i < n; i++){
cin >> mn >> mx; x = i;
while(dq.size() && dq.front().fi > mx) dq.pop_front();
while(dq.size() && dq.back().fi <= mn) {
x = dq.back().se; dq.pop_back();
}
dq.emplace_back(mn, x);
ans = max(ans, i - dq.front().se + 1);
}
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
324 KB |
Output is correct |
2 |
Correct |
1 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
328 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
336 KB |
Output is correct |
2 |
Correct |
3 ms |
416 KB |
Output is correct |
3 |
Correct |
2 ms |
336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
67 ms |
3236 KB |
Output is correct |
2 |
Correct |
66 ms |
3872 KB |
Output is correct |
3 |
Correct |
75 ms |
4132 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
155 ms |
10804 KB |
Output is correct |
2 |
Correct |
158 ms |
11672 KB |
Output is correct |
3 |
Correct |
175 ms |
13580 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
217 ms |
15800 KB |
Output is correct |
2 |
Correct |
200 ms |
11944 KB |
Output is correct |
3 |
Correct |
198 ms |
19060 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
218 ms |
18496 KB |
Output is correct |
2 |
Correct |
187 ms |
12344 KB |
Output is correct |
3 |
Correct |
249 ms |
23424 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
209 ms |
17504 KB |
Output is correct |
2 |
Correct |
147 ms |
11096 KB |
Output is correct |
3 |
Correct |
161 ms |
11944 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
111 ms |
5544 KB |
Output is correct |
2 |
Correct |
119 ms |
5672 KB |
Output is correct |
3 |
Correct |
112 ms |
5804 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
120 ms |
5284 KB |
Output is correct |
2 |
Correct |
128 ms |
5792 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
197 ms |
15416 KB |
Output is correct |
2 |
Correct |
234 ms |
23296 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
193 ms |
14904 KB |
Output is correct |
2 |
Correct |
238 ms |
20764 KB |
Output is correct |