new year chaos

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
 
def minimumBribes(q):
    b = 0
    i = len(q) - 1

    while i > 0:
        max_ind = i
        c = 1
        # yes, it's still O(n) because the inner loop is bounded by 3
        for j in range(1, 4):
            if q[max_ind] < q[max_ind - c]:
                max_ind = i - j
                c = 1
            else:
                c += 1
        if i - max_ind > 2:
            print("Too chaotic")
            return
        b += i - max_ind
        q.pop(max_ind)
        i-=1
    print(b)

if __name__ == "__main__":
    minimumBribes([2, 5, 1, 3, 4]) # Too chaotic