Cod sursa(job #3321429)
| Utilizator | Data | 9 noiembrie 2025 14:22:10 | |
|---|---|---|---|
| Problema | Operatii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("operatii.in");
ofstream fout("operatii.out");
const int Nmax = 1e6 + 5;
int v[Nmax], pozToBeOpened[Nmax];
long long ans;
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n; ++i)
fin >> v[i];
for(int i = 1; i <= n; ++i)
{
pozToBeOpened[i] = max(0, v[i] - v[i - 1]);
ans += 1LL * pozToBeOpened[i];
}
fout << ans;
return 0;
}
