Pagini recente » Diferente pentru problema/domino4 intre reviziile 7 si 14 | Rezultatele filtrării | Cod sursa (job #2450938)
#include <fstream>
#include <deque>
#include <limits.h>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
deque <int> dque;
long long N, K, S, mind = INT_MAX;
int main(){
in >> N >> K;
int numar, counter = 0, poz;
for(int i = 1; i<=N; i++){
in >> numar;
dque.push_front(numar);
if(numar < mind && counter <= 3){
mind = numar;
counter = 0;
poz = i;
}
else{
mind = INT_MAX;
dque.pop_back();
for(int i = 0; i<3; i++)
if(dque[i] < mind)
mind = dque[i];
counter = 0;
poz = i;
}
++counter;
if(i >= 3)
S+=mind;
}
out << S;
return 0;
}