Задача по теме "динамическое программирование"

def find_place(arr, num):
    left = 0
    right = len(arr)
 
    while left < right:
        middle = (left + right) // 2
        if arr[middle] < num:
            left = middle + 1
        else:
            right = middle
    return left
 
 
with open('34.txt', 'r', encoding='utf-8') as f:
    arr = list(map(int, f.read().splitlines()))
 
minimum = float('inf')
maximum = float('-inf')
 
a = sorted(arr)
 
for num in arr:
    v = num % 100
    if v == 52 and num < minimum:
        minimum = num
    elif v == 52 and num > maximum:
        maximum = num
 
s = maximum - minimum
 
border = find_place(a, s)
less = a[:border]
more = a[border:]
 
print(len(less) * len(more))
print(less[-1] + more[-1])

with open('34.txt', 'r', encoding='utf-8') as f:
    arr = list(map(int, f.read().splitlines()))
 
minimum = float('inf')
maximum = float('-inf')
 
for num in arr:
    v = num % 100
    if v == 52 and num < minimum:
        minimum = num
    elif v == 52 and num > maximum:
        maximum = num
 
s = maximum - minimum
 
count = 0
max_sum = float('-inf')
for i in range(len(arr) - 1):
    if (arr[i] < s and arr[i + 1] >= s) or (arr[i] >= s and arr[i + 1] < s):
        count += 1
        max_sum = max(max_sum, arr[i] + arr[i + 1])
print(count)
print(max_sum)

file = open('17')
cnt = 0
s = file.readlines()
s = list(map(int,s))
large = -1
mini = 100000
for i in range(len(s)):
    if s[i] % 100 == 52 and s[i] > large:
        large = s[i]
for i in range(len(s)):
    if s[i] % 100 == 52 and s[i] < mini:
        mini = s[i]
 
razn = large - mini
 
for i in range(len(s)-1):
    if s[i] < razn and s[i+1] > razn or s[i] > razn and s[i+1] < razn:
        cnt += 1
        large = max(large,s[i] + s[i+1])
print(cnt,large)