Cod sursa(job #2304684)
| Utilizator | Data | 18 decembrie 2018 15:00:28 | |
|---|---|---|---|
| Problema | Deque | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#define inf 5000000
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int st,dr=1,n,k,i;
long long s;
int d[inf],v[inf];
int main(){
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
while(st<=dr&&v[i]<=v[d[dr]])
dr--;
d[++dr]=i;
if(d[st]+k==i)
st++;
if(i>=k)
s+=v[d[st]];
}
fout<<s;
}
