Cod sursa(job #2264371)
| Utilizator | Data | 20 octombrie 2018 08:50:44 | |
|---|---|---|---|
| Problema | Deque | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <stdio.h>
#include <deque>
using namespace std;
FILE*f=fopen("deque.in","r");
FILE*g=fopen("deque.out","w");
int i,a[5000001],n,k;
deque <int> d;
long long s;
int main()
{
fscanf(f,"%d%d",&n,&k);
for(i=1;i<=n;i++) fscanf(f,"%d",&a[i]);
for(i=1;i<=n;i++){
while(!d.empty()&&a[d.back()]>=a[i])
d.pop_back();
d.push_back(i);
if(i-d.front()==k)
d.pop_front();
if(i>=k) s+=a[d.front()];
}
fprintf(g,"%lld\n",s);
return 0;
}
