Cod sursa(job #1051234)
| Utilizator | Data | 9 decembrie 2013 20:56:49 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <cstdio>
#include <deque>
#define N 5000000
using namespace std;
int v[N];
deque <int> q;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
int n,k;
scanf("%d %d",&n,&k);
long long int s=0;
for(int i=0;i<n;++i)
{
scanf("%d",&v[i]);
if(i - q.front()==k) q.pop_front();
while(!q.empty() && v[q.back()]>=v[i])
q.pop_back();
q.push_back(i);
if(i>=k-1) s+=v[q.front()];
}
printf("%lld\n",s);
return 0;
}
