Cod sursa(job #1318629)
| Utilizator | Data | 16 ianuarie 2015 10:23:24 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int a[5000010],deque[5000010],n,k,stg,drt,i;
long long s=0;
int main()
{ stg=1,drt=0;
f>>n>>k;
for(i=1;i<=n;i++)
{f>>a[i];
while(stg<=drt && a[i]<=a[deque[drt]])
drt--;
drt++; deque[drt]=i;
if(deque[stg]==i-k) stg++;
if(i>=k) s=s+a[deque[stg]];
}
g<<s;
return 0;
}
