Башня

def push(stack, elem):
    stack.append(elem)
    return elem
def top(stack):
    return stack[-1]
def pop(stack):
    return stack.pop()
def size(stack):
    return len(stack)
def power(a, n):
    if n == 0:
        return 1
    elif n % 2 == 0:
        return power(a * a, n // 2)
    else:
        return power(a, n - 1) * a
inf = 2 * power(10, 9) + 1
n, k = map(int, input().split())
a = [-inf] + list(map(int, input().split())) + [-inf]
p = [0] * (n + 2)
for i in range(1, n + 1):
    p[i] = p[i - 1] + a[i]
p[-1] = p[-2]
stack = []
push(stack, 0)
ans = [0] * (n + 2)
for i in range(n + 2):
    while a[top(stack)] > a[i]:
        ans[pop(stack)] = i
    push(stack, i)
imin = 1
res = [0] * (n - k + 2)
for i in range(1, n - k + 2):
    if imin < i:
        imin = i
    while ans[imin] < i + k:
        imin = ans[imin]
    res[i] = a[imin] * (p[i + k - 1] - p[i - 1])
 
#https://informatics.mccme.ru/moodle/mod/statements/view.php?chapterid=3583#1

from collections import deque
 
n, k = map(int, input().split())
x, d, ssum = list(map(int, input().split())), deque(), 0
b = [(0, [])] * (k + 1)
p = [0] * (n + 1)
for i in range(1, n + 1):
    p[i] = p[i - 1] + x[i -1]
idx = 1
for i in range(n):
    ssum = p[idx]
    if i >= k:
        ssum = p[idx] - p[idx - k]
        if d[0] == i - k:
            d.popleft()
    while len(d) and x[d[-1]] >= x[i]:
        d.pop()
    d.append(i)
    if i >= k - 1:
        i1 = (i - 1) % (k + 1)
        ik = (i - k) % (k + 1)
        ii = i % (k + 1)
        nb = (b[ik][0] + x[d[0]] * ssum, b[ik][1] + [i - k + 2])
        b[ii] = max(b[i1], nb, key=lambda x: x[0])
    idx += 1
print(len(max(b)[1]))
print(*max(b)[1])

from math import fabs
from collections import Counter
 
NN = 1000000
eps = int(1e-7)
h = [0 for _ in range(NN)]
 
 
def get_h():
    global a, h, s
    assert (s < t)
    return a[h[s]]
 
 
def pop_h():
    global s, h
    assert (s < t)
    s += 1
    return h[s - 1]
 
 
def push_h(x):
    global t, h, s, a
    while s < t and a[h[t - 1]] < a[x]:
        t -= 1
    h[t] = x
    t += 1
 
 
n, C = str(input()).split()
n = int(n)
C = float(C)
a = [0 for _ in range(NN)]
for i in range(n - 1):
    a[i] = int(input())
p = [0 for i in range(n)]
s = 0
t = 0
i = 0
j = 1
l = C
r = 0
push_h(0)
while j < n and i < j  and l > a[j - 1] + eps:
    ev1 = (l - r) * (j - i) / (j - i + 1)
    if s < t:
        ev2 = (l - get_h()) * (j - i)
        ev = min(ev2, ev1)
    else:
        ev = ev1
    l -= (ev / (j - i))
    r += ev
    if fabs(l - r) <= eps:
        push_h(j)
        j += 1
        r = 0
    if fabs(l - get_h()) <= eps:
        x = pop_h()
        while i <= x:
            p[i] = l
            i += 1
        i = x + 1
    if (i == j) or (l < a[j - 1] + eps):
        while i < j:
            p[i] = l
            i += 1
        l = r
        r = 0
        i = j
        push_h(j)
        j += 1
while i < j:
    p[i] = l
    i += 1
for i in range(n):
    print(float(p[i]))

from collections import deque
 
n, k = map(int, input().split())
x, d, ssum = list(map(int, input().split())), deque(), 0
b = [(0,0) for i in range(n)]
for i in range(n):
    ssum += x[i]
    if i >= k :
        ssum -= x[i - k]
        if d[0] == i - k :
            d.popleft()
    while len(d) and x[d[-1]] >= x[i]:
        d.pop()
    d.append(i)
    if i >= k - 1:
        nb = (b[i-k][0] + x[d[0]] * ssum, i-k+2)
        b[i] = max(b[i-1], nb, key=lambda x: x[0])
i = n - 1
d = deque()
j = b[-1][1]
d.appendleft(j)
while i !=0:
    i -= 1
    j1 = b[i][1]
    if j-k>=j1 :
        d.appendleft(j1)
        j = j1
print(int(len(d)))
for i in d:
    print(int(i),end = ' ')
print()

from collections import deque
 
n, k = map(int, input().split())
x, d, ssum = list(map(int, input().split())), deque(), 0
b = [(0, 0) for i in range(n)]
for i in range(n):
    ssum += x[i]
    if i >= k:
        ssum -= x[i - k]
        if d[0] == i - k:
            d.popleft()
    while len(d) and x[d[-1]] >= x[i]:
        d.pop()
    d.append(i)
    if i >= k - 1:
        nb = (b[i - k][0] + x[d[0]] * ssum, i - k + 2)
        b[i] = max(b[i - 1], nb, key=lambda x: x[0])
i = n - 1
d = deque()
j = b[-1][1]
d.appendleft(str(j))
while i != 0:
    i -= 1
    j1 = b[i][1]
    if j - k >= j1:
        d.appendleft(str(j1))
        j = j1
print(int(len(d)))
print(" ".join(d))