Pagini recente » Cod sursa (job #2959923) | Cod sursa (job #539446) | Cod sursa (job #2793207) | Cod sursa (job #2935162) | Cod sursa (job #393595)
Cod sursa(job #393595)
#include<fstream.h>
ifstream fin("deque.in");
ofstream fout("deque.out");
long a[5000001],c[5000001],n,m,inc,sf,i;
long long s;
int main()
{
fin>>n>>m;
inc=1;sf=0;
for (i=1;i<=n;i++)
fin>>a[i];
for (i=1;i<=n;i++)
{
while (inc<=sf && a[i]<=a[c[sf]]) sf--;
sf++;
c[sf]=i;
if (c[inc]==i-m) inc++;
if (i>=m) s+=a[c[inc]];
}
fout<<s;
fout.close();
return 0;
}