Cod sursa(job #2936909)
Utilizator | Data | 9 noiembrie 2022 17:50:17 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | cnilc1_2-dq | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
long long int n , i , k , x , fr[5000005] , a[5000005] , p , u , s;
deque <long long int> q;
ifstream f("maxsecvk.in");
ofstream g("maxsecvk.out");
int main()
{
f >> n >> k;
for(i=1;i<=n;i++) f >> a[i] , fr[i]=i;
for(i=1;i<=n;i++){
p++;
while(!q.empty() && a[i]<a[q.back()]){
q.pop_back();
}
q.push_back(i);
while(!q.empty() && fr[i]-fr[q.front()]+1>k) q.pop_front();
if(p>=k && !q.empty()) s+=a[q.front()];
}
g << s;
}