Pagini recente » Cod sursa (job #832483) | Cod sursa (job #1071268) | Cod sursa (job #41085) | Cod sursa (job #1985932) | Cod sursa (job #3211425)
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream fin("scmax.in");
ofstream fout("scmax.out");
long long int v[2000000001],l[2000000001],i,k,n,lmax,lf[2000000001],a=0;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
for(k=1;k<=n;k++)
{
l[k]=1;
for(i=1;i<k;i++)
{
if(v[i]<v[k])
{
if(l[i]+1>l[k])
{
l[k]++;
}
}
}
}
lmax = *max_element(l+1,l+n+1);
fout<<lmax<<endl;
i=n;
while(i>0)
{
if(l[i]==lmax)
{
lmax--;
a++;
lf[a]=v[i];
}
i--;
}
for(i=a;i>=1;i--)
{
fout<<lf[i]<<" ";
}
}