Pagini recente » Cod sursa (job #1298171) | Cod sursa (job #1728038) | Cod sursa (job #1088431) | Cod sursa (job #595612) | Cod sursa (job #2261435)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100005],lis[100005],urm[100005],n,i,j,maxim,start;
int main()
{
fin>>n;
for(i=1;i<=n;++i)
fin>>v[i];
for(i=n;i>=1;--i)
{
for(j=i+1;j<=n;++j)
{
if(v[i]<v[j] && lis[i]<=lis[j])
lis[i]=lis[j]+1, urm[i]=j;
}
if(lis[i]==0)
lis[i]=1, urm[i]=0;
if(lis[i]>maxim)
maxim=lis[i], start=i;
}
fout<<maxim<<'\n';
do
{
maxim--;
fout<<v[start]<<' ';
start=urm[start];
}while(maxim>0);
return 0;
}