Pagini recente » Cod sursa (job #3278603) | Cod sursa (job #2424120) | Cod sursa (job #3233642) | Cod sursa (job #3270662) | Cod sursa (job #1965752)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{int n,v[100002],lung[100002],next[100002],i,lmax=1,j,l,ic;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
}
lung[n]=1;
for(i=n-1; i>=1; i--)
{
j=i+1;
l=0;
next[i]=0;
while(j<=n)
{
if(v[j]>v[i])
{
if(lung[j]>l)
{
l=lung[j];
next[i]=j;
}
}
j++;
}
lung[i]=l+1;
if(lung[i]>lmax)
{
lmax=lung[i];
ic=i;
}
}
fout<<lmax<<'\n';
do
{
fout<<v[ic]<<' ';
ic=next[ic];
}while(ic);
return 0;
}