Cod sursa(job #3126656)
| Utilizator | Data | 6 mai 2023 20:19:32 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int vct[5000001];
int main() {
int N, K,x,min_val,sum=0,i;
f>>N>>K;
for(i=1;i<=N;i++)
{f>>vct[i]; cout<<vct[i]<<" ";}
cout<<endl;
for(i=2;i<=N-1;i++)
{
min_val= min(vct[i-1],vct[i]);
min_val=min(vct[i+1], min_val);
sum=sum+min_val;
cout<<min_val<<" ";
}
g<< sum << endl;
return 0;
}