Cod sursa(job #418928)
Utilizator | Buli.vlad devill_08 | Data | 16 martie 2010 18:37:45 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
long n,a[1000000],i,k=1,b[1000000];
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=2;i<=n;i++)
if(a[i]-a[i-1]>0)
{
b[k]=a[i-1];
k++;
}
if(a[n]-a[n-1]>0) b[k]=a[n];
printf("%ld\n", k);
for(i=1;i<=k;i++) printf("%ld ", b[i]);
return 0;
}