Cod sursa(job #1059140)
Utilizator | Serbanescu Corina corina.ioana | Data | 16 decembrie 2013 11:33:07 |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <cstdio>
#include <deque>
using namespace std;
deque <int> a;
int b[5000001],n,k,i,S;
int main ()
{
freopen ("deque.in","r",stdin);
freopen ("deque.out","w",stdout);
scanf("%d %d", &n,&k);
for (i=1; i<=n; i++)
{
scanf ("%d",&b[i]);
}
for (i=1; i<=n; i++)
{
if (!a.empty())
while (b[i]<b[a.back()])
{
a.pop_back();
}
a.push_back(i);
while (a.front()<=i-k)
{
a.pop_front();
}
if (i>=k)S+=b[a.front()];
}
printf ("%d", S);
return 0;
}