Cod sursa(job #2341153)
| Utilizator | Data | 11 februarie 2019 17:03:48 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,k,v[5000000],st,dr,s,dq[5000000];
int main()
{
int i;
f>>n>>k;
for(i=0; i<n; i++)
f>>v[i];
st=0;
dr=-1;
for(i=0; i<n; i++)
{
if(st<=dr && dq[st]==i-k)
st++;
while(st<=dr && v[i]<=v[dq[dr]])
dr--;
dq[++dr]=i;
if(i>=k-1)
s=s+v[dq[st]];
}
g<<s;
return 0;
}
