Cod sursa(job #299116)
Utilizator | Data | 6 aprilie 2009 16:29:11 | |
---|---|---|---|
Problema | Deque | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
#include<iostream>
using namespace std;
int a[500000],i,k, n;
int min(int p)
{ int min=a[p],i;
for(i=p;i<p+k;i++)
if(a[i]<min)
min=a[i];
return min;
}
int main()
{int s=0;
ifstream f("deque.in");
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
f.close();
for(i=1;i<=n;i++)
s=s+min(i);
ofstream g("deque.out");
g<<s;
g.close();
return 0;
}