Cod sursa(job #3323555)
| Utilizator | Data | 18 noiembrie 2025 18:01:08 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
int v[5000001], c[5000001];
ifstream cin("deque.in");
ofstream cout("deque.out");
int main()
{
int n,k;
cin>>n>>k;
int inc,sf;
long long s=0;
for(int i=1;i<=n;i++)
{
cin>>v[i];
}
inc=sf=1;
c[1]=1;
for(int i=2;i<=n;i++)
{
if(c[inc]<i-k+1)
inc++;
while(inc<=sf and v[i]<v[c[sf]])
{
sf--;
}
sf++;
c[sf]=i;
if(i>=k)
{
s+=v[c[inc]];
}
}
cout<<s;
return 0;
}