Pagini recente » Cod sursa (job #2046509) | Cod sursa (job #868115) | Istoria paginii runda/kek/clasament | Cod sursa (job #2504547) | Cod sursa (job #1787249)
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,v[100001],p,a[100001],sol[100001],ns;
int main ()
{
f>>n;
for(int i=1;i<=n;++i)
f>>v[i];
sol[n]=1;p=n;
ns=1;
for(int i=n-1;i>+1;--i)
{
int w=0;
for(int j=i+1;j<=n;++j)
if(sol[j]>w && v[j]>v[i])
w=sol[j];
sol[i]=w+1;
if(ns<w+1)
ns=w+1;
}
g<<ns<<'\n'<<v[p]<<' ';
int k=p; p++; ns--;
for(int i=p;i<=n;++i)
{
if(sol[i]==ns && v[i]>v[k])
{
g<<v[i]<<' ';
k=i;
ns--;
}
}
g.close();
return 0;
}