Pagini recente » Cod sursa (job #2539892) | Cod sursa (job #2251480) | Cod sursa (job #676132) | Cod sursa (job #3031571) | Cod sursa (job #1786190)
#include <cstdio>
#define NMAX 100005
using namespace std;
int a[NMAX], n, b[NMAX], c[NMAX];
void citire()
{
scanf("%d", &n);
for(int i=0;i<n;i++)
scanf("%d ", &a[i]);
}
int maxim(int i)
{
int maxi=a[i], nrmax=0;
for(int j=n-1;j>i;j--)
if(maxi<a[j])
nrmax=j;
return b[nrmax];
}
void generare()
{
int lmax=0;
for(int i=n-1;i>=0;i--)
{
b[i]=maxim(i)+1;
if(lmax<b[i])
lmax=b[i];
}
printf("%d\n", lmax);
}
void solutie()
{
int nr=0, maxi=b[n-1];
for(int i=n-1;i>=0;i--)
if(b[i]>maxi)
{
maxi=b[i];
c[nr++]=a[i];
}
for(int i=nr-1;i>=0;i--)
printf("%d ", c[i]);
printf("%d ", a[n-1]);
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
citire();
generare();
solutie();
return 0;
}