Pagini recente » Cod sursa (job #2233485) | Istoria paginii runda/easyoji/clasament | Cod sursa (job #1457101) | Cod sursa (job #1009438) | Cod sursa (job #2044423)
#include <fstream>
#define NMAX 5000005
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n, k, a[NMAX], dq[NMAX], in, sf, sum, i;
int main()
{
fin>>n>>k;
for(i=1; i<=n; i++)
fin>>a[i];
in=1;
for(i=1; i<=n; i++)
{while(in<=sf && a[i]<=a[dq[sf]])
sf--;
dq[++sf]=i;
if(dq[in] == i-k)
in++;
if(i>=k)
sum+=a[dq[in]];
}
fout<<sum<<'\n';
fin.close();
fout.close();
return 0;
}