Cod sursa(job #418944)
| Utilizator | Data | 16 martie 2010 19:02:40 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
long n,a[2000000],i,k=1;
int main ()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%ld\n", &n);
for(i=1;i<=n;i++) scanf("%ld", &a[i]);
for(i=1;i<n;i++)
if(a[i+1]-a[i]>0&&a[i]!=a[i-1])
{
k++;
i++;
}
else a[i]=0;
if(a[n]-a[k]>0) k++;
printf("%ld\n", k);
for(i=1;i<=n;i++)
if (a[i]!=0) printf("%ld ", a[i]);
return 0;
}
