Cod sursa(job #2716399)
Utilizator | Data | 5 martie 2021 09:49:53 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int dq[5000001];
int v[5000001];
int main()
{
int st=0,dr=-1,n,k;
long long s=0;
cin>>n>>k;
for(int i=0; i<n; i++)
{
cin>>v[i];
if(st<=dr && dq[st]==i-k)
{
st++;
}
while(st<=dr && v[i]<=v[dq[dr]])
{
dr--;
}
dq[++dr]=i;
if(i>=k-1)
{
s+=v[dq[st]];
}
}
cout<<s;
return 0;
}