Cod sursa(job #402174)
Utilizator | Data | 23 februarie 2010 16:16:55 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
int main()
{
int a[1000000],n,i,j,k,s=0,min;
ifstream fin("deque.in");
ofstream fout("deque.out");
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a[i];
fin.close();
for(i=1;i<=n-k+1;i++)
{
min=a[i];
for(j=i;j<=i+k-1;j++)
if(a[j]<min)
min=a[j];
s+=min;
}
fout<<s;
fout.close();
}