Pagini recente » Cod sursa (job #2938657) | Cod sursa (job #2055842) | Cod sursa (job #889106) | Cod sursa (job #1239706) | Cod sursa (job #1785919)
#include <iostream>
#include <cstdio>
using namespace std;
int a[100000], l[100000],n,lm;
void cautare_lungimi()
{
for(int i=n-1;i>=0;i--)
{
int m=0;
for(int j=i+1;j<n;j++)
if(a[j]>a[i])
m=max(m, l[j]);
l[i]=1+m;
lm=max(l[i],lm);
}
}
void afisare()
{
for(int i=0;i<n;i++)
{
if(l[i]==lm)
printf("%d ", a[i]), lm--;
}
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d\n", &n);
for(int i=0;i<n-1;i++)
{
scanf("%d ", &a[i]);
}
scanf("%d/n", &a[n-1]);
cautare_lungimi();
printf("%d\n", lm);
afisare();
return 0;
}