Pagini recente » Cod sursa (job #815333) | Cod sursa (job #1857786) | Cod sursa (job #300154) | Cod sursa (job #390327) | Cod sursa (job #552222)
Cod sursa(job #552222)
#include<iostream>
#include<stdio.h>
using namespace std;
int t[100001], l[100001],v[100001] ,bien, poz, n;
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
int i,j,len = 0;
scanf("%d",&n);
for( i=1; i<=n; i++ )
scanf("%d",&v[i]);
t[0] = v[1]; len++;
for( i=2; i<=n; i++ )
{
bool ok = true;
for( j=0; j<len && ok ; j++ )
if(v[i]<=t[j])
{
ok = false;
t[j] = v[i];
}
if( ok )
t[len++] = v[i];
}
cout<<len<<"\n";
for( i=0; i<len; i++ )
printf("%d ",t[i]);
printf("\n");
return 0;
}