Cod sursa(job #540741)
Utilizator | Data | 24 februarie 2011 12:38:44 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream.h>
ifstream f("deque.in");
ofstream g("deque.out");
int s,n,i,m,j,k,a[500001];
int main()
{ f>>n>>k;
for(i=1;i<=n;i++) f>>a[i];
s=0;
for(i=1;i<=n-k+1;i++)
{ m=a[i];
for(j=i+1;j<=i+k-1;j++) if(a[j]<m) m=a[i];
s=s+m;
}
g<<s;
return 0;
f.close();
g.close();
}