Pagini recente » Cod sursa (job #2676135) | Cod sursa (job #2534274) | Cod sursa (job #2635588) | Cod sursa (job #1075911) | Cod sursa (job #1515734)
#include <cstdio>
using namespace std;
const int MaxV = 100000 ;
const int INFINIT = 2000000001 ;
int v[MaxV] ;
int nr[MaxV] ;
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
int cnt = 0 , n , q = 1 ;
scanf("%d",&n);
v[n] = INFINIT ;
for ( int i = 0 ; i < n ; i++ )
{
scanf("%d",&v[i]);
}
for ( int i = 0 ; i < n ; i++ )
{
if ( v[i] < v[i+1] )
{
nr[q] = i ;
q++;
cnt++;
}
else if ( v[i] == v[i+1] ) continue ;
}
printf("%d\n",cnt);
for ( int i = 1 ; i < q ; i++ )
{
printf("%d ",v[nr[i]]) ;
}
return 0 ;
}