#include <bits/stdc++.h>
using namespace std;
int f(vector<long long> a) {
vector<long long> dp;
for (long long i : a) {
long long p = lower_bound(dp.begin(), dp.end(), i)-dp.begin();
if (p == dp.size()) {
dp.push_back(i);
} else {
dp[p] = i;
}
}
return dp.size();
}
int main() {
long long n, b;
vector<long long> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b;
a.push_back(b);
}
long long h = f(a);
cout << h;
}
| # | 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... |