Pagini recente » Cod sursa (job #2161979) | Cod sursa (job #2165395) | Cod sursa (job #3235907) | Borderou de evaluare (job #207899) | Cod sursa (job #1494159)
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout ("deque.out");
long long n,k,v[5000001],st,dr,i,dq[5000001],s;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
st=0;
dr=0;
for(i=1;i<=n;i++)
{
while(dr>=st&&v[i]<v[dq[dr]])
dr--;
dq[++dr]=i;
while(dq[st]==i-k)
st++;
if(i>=k)
s+=v[dq[st]];
}
fout<<s;
return 0;
}