Pagini recente » Cod sursa (job #1866264) | Cod sursa (job #1549734) | Cod sursa (job #2077715) | Cod sursa (job #2942038) | Cod sursa (job #2638139)
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,a[5000002],sol[5000002],k,st,dr;
long long s;
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{
f>>a[i];
}
dr=1;
st=0;
for(int i=1;i<=n;i++)
{
while(dr<=st && a[i]<=a[sol[st]])
{
st--;
}
sol[++st]=i;
if(sol[dr]==i-k)dr++;
if(i>=k)s=s+a[sol[dr]];
}
g<<s<<'\n';
return 0;
}