Cod sursa(job #2934068)
| Utilizator | Data | 5 noiembrie 2022 14:18:29 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
int v[5000000],coada[5000000];
int main()
{
int st=0,dr=1,n,i,x;
long long s=0;
cin>>n>>x;
for(i=1;i<=n;i++)
{
cin>>v[i];
}
for(i=1;i<=n;i++)
{
while(st<=dr && v[i]<=v[coada[dr]])
dr--;
coada[++dr]=i;
if(coada[st]==i-x)
st++;
if(i>=x)
s=s+v[coada[st]];
}
cout<<s;
return 0;
}
