Pagini recente » Cod sursa (job #1825766) | Cod sursa (job #1245308) | Cod sursa (job #1175422) | Cod sursa (job #609433) | Cod sursa (job #632791)
Cod sursa(job #632791)
#include<fstream>
#include<iostream>
using namespace std;
int n,k,sum=0;
int deque[5000001];
int cat;
int main(){
ifstream f("deque.in");
ofstream g("deque.out");
f>>n>>k;
int i,j,t;
f>>j;
short ok=0;
deque[1]=j;
int ct=1;
cat=1;
for(i=2;i<=n;i++){
f>>j;
ok=0;
while(j<deque[ct] && ct>=1){
deque[ct]=j;
ct--;
ok=1;
if(ct==0){
cat=i;
}
}
if(ok==0){
ct++;
deque[ct]=j;
}
else{
ct++;
}
if(i>=k){
cout<<deque[1]<<"\n";
sum=sum+deque[1];
if(i-cat>=k-1)
{
for(j=1;j<ct;j++){
deque[j]=deque[j+1];
}
ct--;
}
}
}
g<<sum<<'\n';
return 0;
}