#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define pb push_back
const ll N = 2e5 + 10;
const ll LOG = 50;
const ll MOD = 1e9 + 7;
const ll INF = 1e9 + 10;
int n, X, a[N], b[N], dp[2][N], ans;
int LIS(){
int len = 0, p = 0;
for (int i = 1; i <= n; i++){
p = upper_bound(b, b + len, a[i]) - b;
b[p] = a[i];
len = max(len, p + 1);
}
cout << len << '\n';
exit(0);
}
int main() {
cin >> n >> X;
for (int i = 1; i <= n; i++){
cin >> a[i];
}
if (X == 0) {LIS();}
else {return 0;}
for (int i = 1; i <= n; i++){
ans = max({ans, dp[0][i], dp[1][i]});
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
98 ms |
3052 KB |
Output is correct |
2 |
Correct |
96 ms |
3052 KB |
Output is correct |
3 |
Correct |
104 ms |
3052 KB |
Output is correct |
4 |
Correct |
97 ms |
3060 KB |
Output is correct |
5 |
Incorrect |
65 ms |
2668 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
1004 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
42 ms |
1644 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |