Cod sursa(job #2274319)
Utilizator | Data | 1 noiembrie 2018 17:58:04 | |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
int main()
{
int n,k,s=0;
in>>n>>k;
int v[n+5],dq[n+5];
int st=0,dr=-1;
for(int i=0; i<n; i++)
{
in>>v[i];
if(i>=k && dq[st]==i-k)
{
st++;
}
while(st<=dr && v[i]<=v[dq[dr]])
{
dr--;
}
dq[++dr]=i;
if(i>=k-1)
s+=v[dq[st]];
}
out<<s;
return 0;
}