Cod sursa(job #2030600)
Utilizator | Data | 1 octombrie 2017 20:28:25 | |
---|---|---|---|
Problema | Deque | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin ("deque.in");
ofstream fout ("deque.out");
int n,k,i,p,u,x,a[5000001],c[5000001];
double sol;
int main(){
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a[i];
p=1;
for(i=1;i<=n;i++){
while(p<=u && a[i]<=a[c[u]])
--u;
c[++u]=i;
if(c[p]==i-k)
++p;
if(i>=k)
sol+=a[c[p]];
}
fout<<sol;
return 0;
}