Cod sursa(job #686115)
| Utilizator | Data | 21 februarie 2012 13:55:05 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<cstdio>
#include<deque>
int n,i,j,k,a[5000000],s;
using namespace std;
deque<int> c;
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",&a[i]);
while ((!c.empty())&&(a[c.back()]>a[i])) c.pop_back();
c.push_back(i);
if (c.front()<=i-k) c.pop_front();
if (i>=k) s+=a[c.front()];
}
printf("%d",s);
return 0;
}