#include <iostream>
#include <vector>
using namespace std;
#define oo 1000000000
int main() {
int n, x; cin >> n >> x;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int sz = 1;
vector<int> dp(n);
vector<int> c(n+1, oo);
c[0] = 0;
c[1] = v[0];
dp[0] = 1;
for (int i = 1; i < n; ++i) {
if (v[i] < c[1]) c[1] = v[i], dp[i] = 1;
else if (v[i] > c[sz]) c[sz+1] = v[i], dp[i] = ++sz;
else {
int k = lower_bound(c.begin(), c.end(), v[i]) - c.begin();
c[k] = v[i];
dp[i] = k;
}
}
int ans = dp[n-1];
c.assign(n+1, 0);
c[0] = oo;
c[1] = v[n-1] + x;
dp[n-1] = 1;
sz = 1;
for (int i = n-2; i >= 0; --i){
if (v[i] > c[1]) ans = max(ans, dp[i]);
else if (v[i] < c[sz]) ans = max(ans, dp[i] + sz);
else{
int k = lower_bound(c.rbegin(), c.rend(), v[i]) - c.rbegin();
k = n - k;
ans = max(ans, dp[i] + k);
}
if (v[i] + x > c[1]) c[1] = v[i] + x;
else if (v[i] + x < c[sz]) c[++sz] = v[i] + x;
else{
int k = lower_bound(c.rbegin(), c.rend(), v[i] + x) - c.rbegin();
k = n - k + 1;
c[k] = v[i] + x;
}
}
cout << ans << "\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
130 ms |
2636 KB |
Output is correct |
2 |
Correct |
130 ms |
2628 KB |
Output is correct |
3 |
Correct |
134 ms |
2648 KB |
Output is correct |
4 |
Correct |
128 ms |
2632 KB |
Output is correct |
5 |
Incorrect |
77 ms |
2616 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
32 ms |
868 KB |
Output is correct |
2 |
Correct |
32 ms |
856 KB |
Output is correct |
3 |
Correct |
30 ms |
880 KB |
Output is correct |
4 |
Incorrect |
19 ms |
844 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
60 ms |
1460 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |