Pagini recente » Cod sursa (job #194616) | Cod sursa (job #3220549) | Cod sursa (job #3224824) | Cod sursa (job #3254714) | Cod sursa (job #3284639)
#include <fstream>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int v[5000001], c[5000001];
int main()
{
int i, n, k, sf=0, in=0;
long long s=0;
v[0]=-10000001;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(i<k)
{
while(in<=sf&&v[i]<v[c[sf]])
sf--;
sf++;
c[sf]=i;
}
else
{
if(i-k+1>c[in])
in++;
while(in<=sf&&v[i]<v[c[sf]])
sf--;
sf++;
c[sf]=i;
s+=v[c[in]];
}
}
cout<<s;
return 0;
}