Cod sursa(job #2936569)
| Utilizator | Data | 8 noiembrie 2022 23:37:25 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
int v[5000001],c[5000001];
int main()
{
long long n,k,sf=0,inc=1,i,s=0;
in>>n>>k;
for(i=1;i<=n;i++)
{
in>>v[i];
if(i<k)
{
while(v[i]<v[c[sf]] && inc<=sf)
--sf;
c[++sf]=i;
}
else
{
if(c[inc]<i-k+1)
inc++;
while(v[i]<v[c[sf]] && inc<=sf)
sf--;
c[++sf]=i;
s+=v[c[inc]];
}
}
out<<s;
return 0;
}
