Cod sursa(job #2776780)
Utilizator | Data | 21 septembrie 2021 10:18:51 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
#define N 5000001
int n,k,i=1,j,Q[N],a[N],L,R;
long long s;
int main()
{
for(f>>n>>k;i<=n;++i) {
for(f>>a[i];L<=R&&a[Q[R]]>=a[i];--R);
Q[++R]=i;
if(i-Q[L]==k)
++L;
if(i>=k)
s+=a[Q[L]];
}
g<<s;
return 0;
}