Cod sursa(job #3163044)
Utilizator | Data | 30 octombrie 2023 13:36:12 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long long n, k;
ifstream fin("deque.in");
ofstream fout("deque.out");
fin >> n >> k;
long long a[n + 1];
for (int i = 0; i < n; i++)
{
fin >> a[i];
}
int totalSuma = 0;
for (int i = 0; i < n - 2; i++)
{
int minim = min(a[i], min(a[i + 1], a[i + 2]));
totalSuma += minim;
}
fout << totalSuma;
}