Cod sursa(job #2850310)
Utilizator | Data | 16 februarie 2022 16:46:41 | |
---|---|---|---|
Problema | Deque | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
long long dq[5000010],v[5000010];
ifstream cin("deque.in");
ofstream cout("deque.out");
int main()
{
long long n,k,i,p=0,s=0,poz=1;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
while(v[dq[p]]>=v[i]&&p>=poz)
p--;
dq[++p]=i;
if(i>=k)
{
if(i-dq[poz]>=k)
poz++;
s=s+v[dq[poz]];
}
}
cout<<s;
return 0;
}