Nu aveti permisiuni pentru a descarca fisierul grader_test2.in
Cod sursa(job #2771662)
| Utilizator | Data | 28 august 2021 16:02:24 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | py | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
f = open("deque.in")
N, K = f.readline().split()
N = int(N)
K = int(K)
L = [0] * 5000000
Deque = [0] * 5000000
s = 0
for i in range(N):
L[i] = int(f.readline())
start = 0
capat = -1
if L[0] < L[1] and L[0] < L[2]:
s += L[0]
for i in range(N):
while start <= capat and L[i] <= L[Deque[capat]]:
capat -= 1
capat += 1
Deque[capat] = i
if Deque[start] == i - K:
start += 1
if i >= K:
s += L[Deque[start]]
g = open("deque.out", 'w')
g.write(str(s))
