Pagini recente » Cod sursa (job #1478903) | Cod sursa (job #36887) | Cod sursa (job #900276) | Cod sursa (job #1418276) | Cod sursa (job #3135191)
#include <iostream>
#include <vector>
#define int long long
using namespace std;
vector<int>v;
vector<int>ans;
int32_t main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
v.push_back(x);
}
ans.push_back(v[0]);
for (int i = 1; i < n; ++i) {
if (v[i] > ans.back())
ans.push_back(v[i]);
else {
int low = lower_bound(ans.begin(), ans.end(), v[i]) - ans.begin();
ans[low] = v[i];
}
}
cout << ans.size();
return 0;
}