Pagini recente » Cod sursa (job #756692) | Cod sursa (job #1609295) | Cod sursa (job #1669919) | Cod sursa (job #1871289) | Cod sursa (job #2204664)
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n,k,i,sol,p,u,v[5000010],d[1000000];
int main() {
fin>>n>>k;
for (i=1;i<=n;i++)
fin>>v[i];
p=1; u=1; d[1]=1;
for (i=2;i<=n;i++) {
while (v[i]<v[d[u]]&&p<=u)
u--;
u++; d[u]=i;
if (i-d[p]==k)
p++;
if (i>=k)
sol+=v[d[p]];
}
fout<<sol;
return 0;
}