Pagini recente » Cod sursa (job #2823581) | Cod sursa (job #1236858) | Cod sursa (job #559541) | Cod sursa (job #2047133) | Cod sursa (job #1342576)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100000],i,j,n,lg[100000],urm[100000],jmax,maxim;
void citire()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
}
void pd()
{
lg[n]=1;urm[n]=0;
for(i=n-1;i>0;i--)
{
jmax=0;
maxim=1;
for(j=i+1;j<=n;j++)
{
if (a[i]<a[j]&&1+lg[j]>maxim)
{
maxim=1+lg[j];
jmax=j;
}
lg[i]=maxim;
urm[i]=jmax;
}
}
}
void afisare()
{
int i,lgmax,imax;
lgmax=lg[1];
imax=1;
for(i=2;i<=n;i++)
{
if(lgmax<lg[i])
{
lgmax=lg[i];
imax=i;
}
}
fout<<lgmax<<'\n';
for(i=imax;i;i=urm[i])
{
fout<<a[i]<<' ';
}
}
int main()
{
citire();
pd();
afisare();
return 0;
}