Pagini recente » Cod sursa (job #2707370) | Cod sursa (job #2589053) | Cod sursa (job #1341093) | Cod sursa (job #1222779) | Cod sursa (job #1785981)
#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]);
}
void generare()
{
for(int i=n-1;i>=0;i--)
{
int nr=1;
for(int j=n-1;j>=i;j--)
{
if(a[i]<a[j] && b[j]!=b[j-1])
nr++;
}
b[i]=nr;
}
}
void solutie()
{
int lmax=1, nr=0, maxi=b[n-1];
for(int i=n-1;i>=0;i--)
if(b[i]>maxi)
{
maxi=b[i];
lmax++;
c[nr++]=a[i];
}
printf("%d\n", lmax);
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;
}