Algorithmic-Problems/buffalo.py at main · pi34/Algorithmic-Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
# IARCS problem

A = [11, 7, 10, 9, 13, 14, 10, 15, 12, 10]
K = 5
l = K // 2
buyed = []
sell = []

def buy(n, var=False):
    if var is True:
        if n == len(A)-1:
            if A[n] > A[n-1]:
                var = False
                sell.append(A[n])
                return
            else:
                return

        elif n == 0:
            return

        if A[n] > A[n+1] and A[n] > A[n-1]:
            var = False
            sell.append(A[n])
            buy(n+1, var)

        elif A[n] > A[n+1]:
            buy(n-1, var)

        elif A[n] > A[n-1]:
            buy(n+1, var)

    else:
        if n == 0:
            if A[n] < A[n+1]:
                var = True
                buyed.append(A[n])
                buy(n+1, var)
            else:
                buy(n+1, var)

        elif n == len(A)-1:
            return

        elif A[n] < A[n+1] and A[n] < A[n-1]:
            var = True
            buyed.append(A[n])
            buy(n+1, var)

        elif A[n] < A[n+1]:
            buy(n-1, var)

        elif A[n] < A[n-1]:
            buy(n+1, var)

buy(0)

profits = []

for i in range(len(buyed)):
    profits.append(sell[i]-buyed[i])

print(sum(profits))