Pagini recente » Cod sursa (job #1594982) | Cod sursa (job #3195037) | Cod sursa (job #7950) | Cod sursa (job #2115725) | Cod sursa (job #2820678)
#include <fstream>
#define ll long long
using namespace std;
ifstream cin ("deque.in");
ofstream cout ("deque.out");
ll n,m,i,a,sum=0,v[5000001],first,last,x[5000001];
int main()
{
cin>>n>>m;
first=1;
last=0;
for (i=1;i<=n;++i)
{
cin>>x[i];
}
//v[1]=1;
for (i=1;i<=n;++i)
{
a=x[i];
while (first<=last && x[v[last]]>a) --last;
v[++last]=i;
if (i>=m)
{
while (v[first]<=i-m) first++;
sum+=x[v[first]];
}
}
cout<<sum;
return 0;
}