Pagini recente » Borderou de evaluare (job #3104661) | Borderou de evaluare (job #3104654) | Borderou de evaluare (job #3103680) | Borderou de evaluare (job #3103699) | Cod sursa (job #3326655)
#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;
}