Pagini recente » Cod sursa (job #126775) | Borderou de evaluare (job #1510506) | Borderou de evaluare (job #1341988) | Cod sursa (job #2880260) | Cod sursa (job #114982)
Cod sursa(job #114982)
#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;
}