Cod sursa(job #3288324)
| Utilizator | Data | 21 martie 2025 14:43:21 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int coada[5000001];
int v[5000001];
int main()
{
int n,k,inc=0,sf=0,n2;
long long s=0;
cin>>n>>k;
for(n2=1;n2<=n;n2++)
{
cin>>v[n2];
while(v[n2]<v[coada[sf]] && sf>=inc)
{
sf--;
}
sf++;
v[coada[sf]]=v[n2];
coada[sf]=n2;
if(coada[inc]<n2-k+1)
{
inc++;
}
if(n2>=k)
{
s+=v[coada[inc]];
}
}
cout<<s;
return 0;
}
