Pagini recente » Cod sursa (job #1219959) | Cod sursa (job #35298) | Cod sursa (job #2329280) | Cod sursa (job #1847370) | Cod sursa (job #820287)
Cod sursa(job #820287)
#include<fstream>
using namespace std;
long long n, k,a[5000000],poz[5000000],i,st,dr,s=0;
int main ()
{ifstream f("deque.in");
ofstream g("deque.out");
f>>n>>k;
st=1;
dr=0;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{while(dr>=st&&a[i]<=a[poz[dr]])dr--;
poz[++dr]=i;
if(poz[st]+k==i)st++;
if(i>=k)s+=a[poz[st]];
}
g<<s;
return 0;}