Cod sursa(job #592314)
Utilizator | Data | 27 mai 2011 19:22:04 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int a[5000],c[5000],i,j,e,k,b,n,s;
int main()
{
f>>n>>k;
b=1;e=0;
for (i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
while (e>=b&&a[i]<a[c[e]])
e--;
e++;c[e]=i;
if (c[b]==i-k) b++;
if (i>=k) s=s+a[c[b]];
}g<<s<<'\n';
return 0;
}