Pagini recente » Istoria paginii utilizator/archaryon | Profil speranta01 | Profil Floricel | Istoria paginii utilizator/raisa_grigoras | Cod sursa (job #1330791)
#include <fstream>
#define DIM 5000002
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int N,K,x,d[DIM],p,u,v[DIM];
long long sum;
int main(){
fin>>N>>K;
p=1;
u=0;
for(int i=1;i<=N;i++){
fin>>v[i];
while(p<=u && v[i]<v[d[u]])
u--;
d[++u]=i;
if(i-d[p]==K)
p++;
if(i>=K)
sum+=v[d[p]];
}
fout<<sum;
fin.close();fout.close();
return 0;
}