Cod sursa(job #613975)
| Utilizator | Data | 5 octombrie 2011 10:28:57 | |
|---|---|---|---|
| Problema | Deque | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream>
#include<fstream>
using namespace std;
long long a[5000002];
int main()
{
ifstream fin("deque.in");
ofstream fout("deque.out");
int k,i,j,n;
long long f=0,m;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
for(i=1;i<=n-k+1;i++)
{
m=10000000;
for(j=i;j<i+k;j++)
{
m=min(a[j],m);
}
cout<<m<<" ";
f+=m;
}
fout<<f;
fin.close();
fout.close();
return 0;
}
