Pagini recente » Borderou de evaluare (job #3293313) | Cod sursa (job #3274685) | Arhiva educationala - tehnici de programare, algoritmi clasici | Cod sursa (job #3274684) | Cod sursa (job #3293801)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fcin("scmax.in");
ofstream fout("scmax.out");
int n,x,lis[1000001];
vector <int> v;
inline void sclm(const vector <int> &v)
{
vector <int> stv,rez;
for(int i=0; i<v.size(); i++)
{
lis[i]=lower_bound(stv.begin(), stv.end(), v[i])-stv.begin();
if(lis[i]==stv.size()) stv.push_back(v[i]);
else stv[lis[i]]=v[i];
}
fout<<stv.size()<<'\n';
int maxx=stv.size()-1;
for(int i=v.size()-1; i>=0 && maxx>=0; i--)
if(lis[i]==maxx) rez.push_back(v[i]), maxx--;
for(int i=rez.size()-1; i>=0; i--)
fout<<rez[i]<<" ";
}
int main()
{
fcin>>n;
for(int i=1; i<=n; i++)
fcin>>x, v.push_back(x);
sclm(v);
return 0;
}