Pagini recente » Borderou de evaluare (job #2625466) | Borderou de evaluare (job #2699659) | Borderou de evaluare (job #1475954) | Cod sursa (job #1663716) | Cod sursa (job #247147)
Cod sursa(job #247147)
#include<stdio.h>
long long int N,v[1000000],i,j,k,min,max,ok;
int main ()
{
FILE*in=fopen("operatii.in","r");
FILE*out=fopen("operatii.out","w");
fscanf(in,"%lld",&N);
v[0]=0;
for(i=1;i<=N;i++)
{
fscanf(in,"%lld",&v[i]);
if(v[i]>v[i-1]) max+=v[i]-v[i-1];
}
fprintf(out,"%lld",max);
fcloseall();
return 0;
}