Pagini recente » Cod sursa (job #2051763) | Cod sursa (job #1194014) | Cod sursa (job #993970) | Cod sursa (job #1053814) | Cod sursa (job #2266941)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100001],lis[100001],urm[100001],n,maxim2,imax;
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;
if(maxim+1>maxim2){
maxim2=maxim+1;
imax=i;
}
urm[i]=in;
}
fout<<maxim2<<'\n';
int i=imax;
fout<<a[imax]<<' ';
do
{
i=urm[i];
fout<<a[i]<<' ';
}while(urm[i]!=0);
return 0;
}