#include <bits/stdc++.h>
using namespace std;
int dude(vector<int>& haha, int x) {
int l = 0,r = haha.size()-1;
while(l < r) {
int m = (l+r+1)/2;
if(haha[m] < x) {
l = m;
}
else {
r = m-1;
}
}
return l;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,x,a,ans = 0,c;
cin >> n >> x;
vector<int> haha(n+1,INT_MAX);
vector<int> bruh(n+1,INT_MAX);
haha[0] = 0;
bruh[0] = 0;
for(int i = 1; i <= n; i++) {
cin >> a;
c = dude(haha,a+x);
ans = max(ans,c+1);
bruh[c+1] = a;
c = dude(haha,a);
ans = max(ans,c+1);
haha[c+1] = a;
c = dude(bruh,a);
ans = max(ans,c+1);
bruh[c+1] = a;
}
cout << ans;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
500 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
500 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
500 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
59 ms |
2016 KB |
Output is correct |
2 |
Correct |
53 ms |
1880 KB |
Output is correct |
3 |
Correct |
60 ms |
1884 KB |
Output is correct |
4 |
Correct |
62 ms |
2020 KB |
Output is correct |
5 |
Correct |
47 ms |
1884 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
860 KB |
Output is correct |
2 |
Correct |
11 ms |
1116 KB |
Output is correct |
3 |
Correct |
11 ms |
1344 KB |
Output is correct |
4 |
Incorrect |
9 ms |
1116 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
28 ms |
1116 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
500 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |