Pagini recente » Cod sursa (job #680475) | Borderou de evaluare (job #1528977) | Cod sursa (job #43964) | Cod sursa (job #649074) | Cod sursa (job #229019)
Cod sursa(job #229019)
#include <stdio.h>
long long e[1000005];
int main()
{
long long n,i,d;
FILE *f1,*f2;
f1=fopen("operatii.in","r");
f2=fopen("operatii.out","w");
fscanf(f1,"%ld",&n);
for(i=1;i<=n;i++)
{
fscanf(f1,"%ld",&e[i]);
}
d=e[1];
for(i=2;i<=n;i++)
{
if(e[i]>e[i-1])
d=d+e[i]-e[i-1];
}
fprintf(f2,"%d",d);
fclose(f1);
fclose(f2);
return 0;
}