#include "bits/stdc++.h"
using ll = long long;
using namespace std;
const int N = 2e5 + 1, mod = 1e9 + 7;
int n, x, ans = 0, a[N], f[2][N];
int main() { cin.tie(0)->sync_with_stdio(0);
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> a[i];
f[0][i] = f[1][i] = INT_MAX;
}
f[0][0] = f[1][0] = -INT_MAX;
for (int i = 1; i <= n; i++) {
int k = lower_bound(f[1] + 1, f[1] + n + 1, a[i]) - f[1];
f[1][k] = a[i];
ans = max(ans, k);
if (i == 1) continue;
k = lower_bound(f[0] + 1, f[0] + n + 1, a[i - 1] - x) - f[0];
f[0][k] = a[i - 1] - x;
f[1][k] = min(f[1][k], f[0][k]);
ans = max(ans, k);
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
63 ms |
2680 KB |
Output is correct |
2 |
Correct |
60 ms |
2684 KB |
Output is correct |
3 |
Correct |
61 ms |
2680 KB |
Output is correct |
4 |
Correct |
61 ms |
2680 KB |
Output is correct |
5 |
Correct |
43 ms |
2680 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
888 KB |
Output is correct |
2 |
Correct |
16 ms |
1056 KB |
Output is correct |
3 |
Correct |
16 ms |
984 KB |
Output is correct |
4 |
Correct |
14 ms |
1016 KB |
Output is correct |
5 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
31 ms |
1656 KB |
Output is correct |
2 |
Correct |
30 ms |
1656 KB |
Output is correct |
3 |
Correct |
59 ms |
2748 KB |
Output is correct |
4 |
Incorrect |
47 ms |
2632 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |