Pagini recente » Cod sursa (job #2891617) | Cod sursa (job #2945288) | Cod sursa (job #1229189) | Cod sursa (job #2230468) | Cod sursa (job #1122443)
#include<fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int v[5000001],deq[5000001],n,k,i,start=1,stop;
long long sum;
int main()
{
fin>>n>>k;
for(i=1;i<=n;++i)
{
fin>>v[i];
while(start<=stop && v[i]<=v[deq[stop]]) --stop;
deq[++stop]=i;
if(deq[start]==i-k) ++start;
if(i>=k) sum+=v[deq[start]];
}
fout<<sum;
return 0;
}