Pagini recente » Cod sursa (job #2484687) | Cod sursa (job #323327) | Cod sursa (job #2627678) | Cod sursa (job #700475) | Cod sursa (job #2981194)
#include <fstream>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
struct dec{
int val,poz;
}v[5000001];
int main()
{
int p=1,u=1,n,i,k,x;
long long sum=0;
cin>>n>>k;
for(i=1;i<k;i++)
{
cin>>x;
while(v[u].val>x && u>=p)
u--;
u++;
v[u].val=x;
v[u].poz=i;
}
for(i=k;i<=n;i++)
{
if(v[p].poz<=i-k)
p++;
cin>>x;
while(v[u].val>x && u>=p)
u--;
u++;
v[u].val=x;
v[u].poz=i;
sum+=v[p].val;
}
cout<<sum;
return 0;
}