Pagini recente » Cod sursa (job #722052) | Cod sursa (job #351780) | Cod sursa (job #2284749) | Cod sursa (job #936947) | Cod sursa (job #2292671)
#include <fstream>
#define nmax 100001
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n;
int a[nmax],t[nmax],lg[nmax];
void citire()
{int i;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
}
void dinamica()
{int i,j;
lg[1]=1; t[1]=0;
for(i=2;i<=n;i++)
{lg[i]=1; t[i]=0;
for(j=1;j<=i-1;j++)
if(a[j]<a[i]&&lg[j]+1>lg[i])
{lg[i]=lg[j]+1;
t[i]=j;
}
}
}
void afisare(int x)
{if(t[x]!=0)
afisare(t[x]);
fout<<a[x]<<" ";
}
void solutie()
{int i,lgmax,imax;
lgmax=0;
for(i=1;i<=n;i++)
if(lg[i]>lgmax)
{lgmax=lg[i];
imax=i;
}
fout<<lgmax<<"\n";
afisare(imax);
}
int main()
{
citire();
fin.close();
dinamica();
solutie();
fout.close();
return 0;
}