Pagini recente » Cod sursa (job #3326722) | Borderou de evaluare (job #508815) | Cod sursa (job #1010558) | Cod sursa (job #2942200) | Cod sursa (job #3326717)
#include <bits/stdc++.h>
using namespace std;
#define int long long
int v[100005];
int afis[100005];
int tip[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]);
int l=0;
for(int i=2; i<=n; i++)
{
if(v[i]>ras.back())
{
ras.push_back(v[i]);
tip[i]=0;
}
else
{
int st=lower_bound(ras.begin(), ras.end(), v[i])-ras.begin();
if(st==ras.size()-1)
tip[i]=1;
else
tip[i]=-1;
ras[st]=v[i];
}
}
cout << ras.size() << '\n';
l=ras.size();
for(int i=n; i>=1; i--)
{
if(tip[i]==0)
{
if(afis[l]==0)
afis[l]=v[i];
l--;
}
else if(afis[l]==0 && tip[i]==1)
afis[l]=v[i];
}
for(int i=1; i<=ras.size(); i++)
cout << afis[i] << ' ';
return 0;
}