Cod sursa(job #2124341)
| Utilizator | Data | 7 februarie 2018 09:37:31 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream in ("deque.in");
ofstream out ("deque.out");
int s=0,i,n,m,x,a,b,c,mi,o;
int main()
{in>>n;
n--;n--;
in>>a>>b>>c;
mi=min(a,b);
mi=min(mi,c);
if(mi==a)o=1;
if(mi==b){o=2;}
if(mi==c)o=3;
for(i=1;i<=n;i++)
{
a=b;
b=c;
in>>c;
o--;
int p;
x=min(a,b);
x=min(x,c);
if(x==a)p=1;
if(x==b)p=2;
if(x==c)p=3;
if(o==0){mi=x;o=p;}
if(x<=mi){mi=x;o=p;}
cout<<mi<< " ";
s=s+mi;
}
out<<s;
return 0;
}
