Cod sursa(job #1060428)
Utilizator | Data | 17 decembrie 2013 23:28:54 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int v[5000001],u[5000001],n,k,i,s,d;
int main()
{
long long x=0;
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
s=1,d=0;
for(i=1;i<=n;i++)
{
while(s<=d && v[i]<=v[u[d]])
d--;
u[++d]=i;
if(u[s]==i-k)
s++;
if(i>=k)
x=x+v[u[s]];
}
g<<x;
return 0;
}