Cod sursa(job #1308537)
Utilizator | Data | 4 ianuarie 2015 12:50:27 | |
---|---|---|---|
Problema | Operatii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int v[1000100], n, i, maxim;
long long k;
int main()
{
ifstream f("operatii.in");
ofstream g("operatii.out");
f >> n;
for (i = 1; i <= n; i++)
f >> v[i];
for (i = 1; i <= n; i++)
{
if (v[i] > v[i-1])
{
k += v[i] - v[i-1];
}
}
g << k;
return 0;
}