Cod sursa(job #116387)
Utilizator | Data | 18 decembrie 2007 15:42:05 | |
---|---|---|---|
Problema | Operatii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<stdio.h>
long long x[10000001],i,j,k,n,l,s;
int main()
{
freopen("operatii.in","r",stdin);
freopen("operatii.out","w",stdout);
scanf("%lld",&n);
for (i=1;i<=n;i++)
scanf("%lld",&x[i]);
for (i=1;i<=n;i++)
{
j=i;
while (x[j]<=x[j+1]&&j<=n) j++;
s+=(x[j]-k);
while (x[j]>=x[j+1]&&j<=n) j++;
k=x[j];
i=j-1;
}
printf("%lld\n",s);
return 0;
}