Cod sursa(job #811496)
| Utilizator | Data | 12 noiembrie 2012 14:57:02 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<iostream>
#include<fstream>
using namespace std;
int c[5000001],v[5000001];
int main ()
{
int n,i,st,dr,k;
long long s;
ifstream f("deque.in");
ofstream g("deque.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
f.close();
s=0;
st=1;
dr=0;
for(i=1;i<=n;i++) {
while((st<=dr)&&(v[c[dr]]>=v[i]))
dr--;
c[++dr]=i;
if(c[st]==(i-k))
st++;
if(i>=k)
s=s+v[c[st]];
}
g<<s;
g.close();
return 0;
}