Mai intai trebuie sa te autentifici.
Cod sursa(job #2037588)
| Utilizator | Data | 12 octombrie 2017 16:02:05 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
int v[5000001],d[5000001];
int main()
{
long long n,k,st=0,dr=0,s=0,i;
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%lld%lld", &n, &k);
for (i=0;i<n;i++) {
scanf("%lld", &v[i]);
if (d[st]==i-k)
st++;
while (st<=dr && v[i]<=v[d[dr]])
dr--;
d[++dr]=i;
if (i>=k-1)
s+=v[d[st]];
}
printf("%lld", s);
return 0;
}
