Pagini recente » Cod sursa (job #1935156) | Cod sursa (job #123473) | Cod sursa (job #1963378) | Cod sursa (job #1468355) | Cod sursa (job #2261361)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100001],lis[100001],urm[100001],n;
int main()
{
fin>>n;
for(int i=1; i<=n; ++i) fin>>a[i];
lis[n]=1;
for(int i=n-1; i>=1; --i)
{
int maxim=0,in=0;
for(int j=i+1; j<=n; ++j)
{
if(a[j]>a[i])
{
if(lis[j]>maxim) maxim=lis[j],in=j;
}
}
lis[i]=maxim+1;
urm[i]=in;
}
int maxim=0,in=0,i=0;
for(int i=1; i<=n; ++i)
{
if(lis[i]>maxim){
maxim=lis[i];
in=i;
}
}
fout<<maxim<<'\n';
i=in;
fout<<a[in]<<' ';
do
{
i=urm[i];
fout<<a[i]<<' ';
}while(i<n);
return 0;
}