Cod sursa(job #2889642)
| Utilizator | Data | 13 aprilie 2022 00:00:49 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<iostream>
#include<fstream>
using namespace std;
int d[5000001], s[5000001];
ifstream fin("deque.in");
ofstream fout("deque.out");
int main()
{
int a=1,b=0;
long long n,k,t=0;
fin>>n>>k;
for(int i=1;i<=n;i++)
fin>>s[i];
for(int i=1;i<=n;i++)
{
while(a<=b && s[i]<=s[d[b]])
b--;
d[++b]=i;
if(i>=k)
t=t+s[d[a]];
if(d[a]==i-k)
a++;
}
fout<<s;
return 0;
}
