Cod sursa(job #273707)
Utilizator | Data | 8 martie 2009 22:09:37 | |
---|---|---|---|
Problema | Operatii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.29 kb |
#include <stdio.h>
long long n,v[1000001],j,k;
int main()
{
freopen("operatii.in","r",stdin);
freopen("operatii.out","w",stdout);
scanf("%lld",&n);
for (j=1;j<=n;j++) scanf("%lld",&v[j]);
for (j=1;j<=n;j++) if (v[j]>v[j-1]) k+=v[j]-v[j-1];
printf("%lld\n",k);
return 0;
}