Cod sursa(job #3326656)
| Utilizator | Data | 29 noiembrie 2025 18:53:49 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int v[100005];
vector<int>ras;
int32_t main()
{
ifstream cin ("scmax.in");
ofstream cout ("scmax.out");
int n;
cin >> n;
for(int i=1; i<=n; i++)
cin >> v[i];
ras.push_back(v[1]);
for(int i=2; i<=n; i++)
{
if(v[i]>ras.back())
ras.push_back(v[i]);
else
{
int st=lower_bound(ras.begin(), ras.end(), v[i])-ras.begin();
ras[st]=v[i];
}
}
cout << ras.size() << '\n';
for(auto i : ras)
cout << i << ' ';
return 0;
}
