This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 3;
int ar[N];
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n, x; cin >> n >> x;
for(int i=1; i<=n; ++i) cin >> ar[i];
vector<int> lis;
for(int i=1; i<=n; ++i) {
auto t = lower_bound(lis.begin(), lis.end(), ar[i]);
if(t == lis.end()) {
lis.emplace_back(ar[i]);
}else {
*t = ar[i];
}
}
cout << lis.size() << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |