Pagini recente » Cod sursa (job #887668) | Cod sursa (job #1379493) | Cod sursa (job #2638653) | Cod sursa (job #1422171) | Cod sursa (job #3195352)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int v[5000001],d[5000001],n,k;
void citire(int &n, int &k)
{
fin>>n>>k;
for(int i=1;i<=n;i++)
fin>>v[i];
}
int main() {
int inc=1,sf=0;// coada vida
long long s=0;
citire(n,k);
for(int i=1;i<=n;i++)
{
// analizam secventa care se termina cu v[i]
while(inc<=sf && v[d[sf]]>=v[i])sf--;
sf++;
d[sf]=i;
if(i>=k){
// v[i-k + 1]........v[i]
if(d[inc]==i-k) inc++;
s=s+v[d[inc]];
}
}
fout<<s;
return 0;
}