Cod sursa(job #3353784)
| Utilizator | Data | 11 mai 2026 15:38:43 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int v[5000001];
int d[5000001];
int main()
{
int n,k,i,inc=0,sf=0;
long long s=0;
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>v[i];
for(i=1;i<=n;i++){
while(inc<=sf && v[d[sf]]>=v[i])
sf--;
d[++sf]=i;
if(i>=k){
if(d[inc]<=i-k)
inc++;
s+=v[d[inc]];
}
}
cout<<s;
return 0;
}
