Cod sursa(job #2293722)
| Utilizator | Data | 1 decembrie 2018 14:51:26 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <vector>
#define maxn 5000010
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,k,li,ls;
long long s;
vector<int>v(maxn),a(maxn);
int main(){
int i;
f>>n>>k;
for(i=1; i<=n; i++){
f>>v[i];
}
li=1;ls=0;
for(i=1; i<=n; i++){
while(li<=ls && v[i]<=v[a[ls]])
ls--;
a[++ls]=i;
if(a[li]==i-k)
li++;
if(i>=k)
s+=v[a[li]];
}
g<<s;
return 0;
}
