Pagini recente » Cod sursa (job #663870) | Cod sursa (job #918565) | Cod sursa (job #905836) | Cod sursa (job #1267460) | Cod sursa (job #1786235)
#include <cstdio>
#include <algorithm>
#define NMAX 100005
using namespace std;
long int a[NMAX], n, b[NMAX], p, maxi, poz[NMAX];
void citire()
{
scanf("%ld", &n);
for(int i=1;i<=n;i++)
scanf("%ld ", &a[i]);
}
void parcurgere(int i)
{
b[i]=1;
poz[i]=-1;
for(int j=i+1;j<=n;j++)
if(a[i]<a[j] && b[i]<b[j]+1)
{
b[i]=b[j]+1;
poz[i]=j;
if(b[i]>maxi)
{
maxi=b[i];
p=i;
}
}
}
void generare()
{
int i;
b[n]=1;
poz[n]=-1;
maxi=1; p=n;
for(i=n-1;i>=1;i--)
parcurgere(i);
printf("%d\n", maxi);
while(p!=-1)
{
printf("%d ",a[p]);
p=poz[p];
}
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
citire();
generare();
return 0;
}