Cod sursa(job #2722931)
| Utilizator | Data | 13 martie 2021 13:19:30 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream fin("deque.in");
ofstream fout("deque.out");
int n,k;
fin>>n>>k;
int *v=new int[n];
int *que=new int[n];
int s=0;
for(int i=0;i<n;i++)
fin>>v[i];
int qs=0,qf=1;
for(int i=0;i<n;i++)
{
while(qf<=qs&&v[que[qs]])qs--;
que[++qs]=i;
if(que[qf]==i-k)qf++;
if(i>=k) s+=v[que[qf]];
}
delete[] v;
delete[] que;
fout<<s;
fin.close();
fout.close();
return 0;
}
