#include <bits/stdc++.h>
using namespace std;
const int N = 2e5, INF = 2e9 + 7;
int nr;
int sol[1 + N], poz[1 + N], scm[1 + N];
int a[1 + N];
inline int get (int n, int orient) {
int st, dr, p;
st = 1; dr = nr;
if (orient)
p = nr;
else
p = 1;
while (st <= dr) {
int mij = (st + dr) / 2;
if ((sol[mij] > n && orient) || (sol[mij] < n && !orient)) {
dr = mij - 1;
p = mij;
}
else
st = mij + 1;
}
return p;
}
int main() {
int n, x;
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> a[i];
sol[1] = INF;
nr = 1;
for (int i = n; i > 0; i--) {
if (a[i] < sol[nr]) {
nr++;
poz[i] = nr;
sol[nr] = a[i];
}
else {
int p = get (a[i], 0);
sol[p] = a[i];
poz[i] = p;
}
}
sol[1] = 0;
nr = 1;
int ans = 0;
for (int i = 1; i <= n; i++) {
int p = get (a[i] + x, 1);
//cout << p << "\n";
ans = max (ans, poz[i] + p - 3);
if (a[i] > sol[nr]) {
nr++;
sol[nr] = a[i];
}
else {
int p = get (a[i], 1);
sol[p] = a[i];
}
}
cout << ans << "\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
189 ms |
3848 KB |
Output is correct |
2 |
Correct |
192 ms |
3820 KB |
Output is correct |
3 |
Correct |
207 ms |
3832 KB |
Output is correct |
4 |
Correct |
190 ms |
3828 KB |
Output is correct |
5 |
Incorrect |
118 ms |
3448 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
48 ms |
1276 KB |
Output is correct |
2 |
Correct |
47 ms |
1144 KB |
Output is correct |
3 |
Correct |
48 ms |
1272 KB |
Output is correct |
4 |
Incorrect |
31 ms |
1144 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
90 ms |
2140 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |