Cod sursa(job #114983)
Utilizator | Data | 16 decembrie 2007 10:04:31 | |
---|---|---|---|
Problema | Operatii | Scor | 80 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 2, Clasa a 9-a | Marime | 0.36 kb |
#include<stdio.h>
long x[1000001],i,j,k,n,l,s;
int main()
{
freopen("operatii.in","r",stdin);
freopen("operatii.out","w",stdout);
scanf("%ld",&n);
for (i=1;i<=n;i++)
scanf("%ld",&x[i]);
for (i=1;i<=n;i++)
{
j=i;
while (x[j]<=x[j+1]) j++;
s+=(x[j]-k);
while (x[j]>=x[j+1]) j++;
k=x[j];
i=j-1;
}
printf("%ld\n",s);
return 0;
}