Cod sursa(job #1316618)
Utilizator | Data | 13 ianuarie 2015 22:44:56 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,k,v[5000001],d[5000001],i,j,q;
long long suma=0;
int main()
{
f>>n>>k;
i=1;
j=0;
for(q=1;q<=n;q++)
f>>v[q];
for(q=1;q<=n;q++)
{
while(i<=j&&v[q]<=v[d[j]]) j--;
j++;
d[j]=q;
if(d[i]==q-k) i++;
if(q>=k) suma=suma+v[d[i]];
}
g<<suma;
return 0;
}