Pagini recente » Cod sursa (job #2534503) | Cod sursa (job #3236379) | Cod sursa (job #2949256) | Cod sursa (job #1753959) | Cod sursa (job #3170538)
#include <iostream>
#include<fstream>
using namespace std;
int sir[5000002] ;
int doustack[5000002];
int main(){
ifstream ci("deque.in");
ofstream cou("deque.out");
int nr,spatiu,fata=1,spate=0;
long long suma=0;
cin>>nr>>spatiu;
for (int i=1;i<=nr;i++){
cin>>sir[i];
}
for (int i=1;i<=nr;i++){
while (fata<=spate&&sir[i]<sir[doustack[spate]]){
spate--;
}
spate++;
doustack[spate]=i;
if (doustack[fata]==i-spatiu){
fata++;
}
if (i>=spatiu){
suma+=sir[doustack[fata]];
}
}
cout<<suma;
return 0;
}