Cod sursa(job #2728281)
Utilizator | Dutu Maria Maria23 | Data | 22 martie 2021 23:47:48 |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int main() {
ifstream fin("deque.in");
ofstream fout("deque.out");
int N, K;
fin>>N>>K;
long long v[N + 1], suma = 0, aux;
for(int i = 0; i < N; i++){
long long x;
fin>>x;
v[i] = x;
}
for(int j = 0; j < N - 2; j++){
aux = min(v[j], v[j + 1]);
suma += min(aux, v[j + 2]);
}
fout<<suma;
fin.close();
fout.close();
return 0;
}