Cod sursa(job #1493984)
Utilizator | Data | 30 septembrie 2015 11:50:18 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
long long i, n, j,k,v[5000000],minim,s;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
for(i=1;i<=n;i++)
{
minim=v[i];
if(minim>v[i+1])
minim=v[i+1];
if(minim>v[i+2])
minim=v[i+2];
s+=minim;
}
fout<<s;
return 0;
}