#include<bits/stdc++.h>
using namespace std;
int main(){
int n, x;
cin >> n >> x;
int a[n];
for(int i = 0;i < n; i++) cin >> a[i];
if(x == 0){
vector<int> dp;
for(int i = 0; i < n; i++){
int idx = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
if(idx == (int)dp.size()){
dp.push_back(a[i]);
}
else{
dp[idx] = a[i];
}
}
cout << dp.size() << "\n";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
64 ms |
2980 KB |
Output is correct |
2 |
Correct |
64 ms |
2900 KB |
Output is correct |
3 |
Correct |
64 ms |
2896 KB |
Output is correct |
4 |
Correct |
64 ms |
2976 KB |
Output is correct |
5 |
Correct |
43 ms |
3032 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
17 ms |
860 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
27 ms |
1624 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |