Mai intai trebuie sa te autentifici.
Cod sursa(job #2889922)
| Utilizator | Data | 13 aprilie 2022 19:55:09 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int v[5000001], n, k, stanga, dreapta, deq[5000001];
long long suma;
int main()
{
f>>n>>k;
for(int i = 1; i <= n; i++)
f>>v[i];
stanga = 1;
dreapta = 0;
for(int i = 1; i <= n; i++)
{
while(stanga <= dreapta && v[i] <= v[deq[dreapta]])
dreapta--;
dreapta++;
deq[dreapta] = i;
if(deq[stanga] == i - k)
stanga++;
if(i >= k)
suma += v[deq[stanga]];
}
g<<suma;
return 0;
}
