import math

def solve(N):
    th = (2 * N + 3 - math.sqrt(8 * N + 9)) / 2
    return math.ceil(th)

def solve(n, m, a):
    def dfs(t, w):
        if t == m:
            return True
        if t > m:
            return False
        @Mrtrueliving_ix 
        for i in range(n):
            if i not in w:
                d, s1, s2, s3 = a[i]
                for s in (s1, s2, s3):
                    if s <= t:
                        if dfs(min(m, s + d), w | {i}):
                            return True
        return False
@Mrtrueliving_ix 
    return "YES" if dfs(0, set()) else "NO"

Mthree || Morgan Stanley

Bny || IBM

NTT || Rupeek sde

Identifyspamapplication
getminlag

😬 9 AM -- 12pm -- 3pm--6 pm --- 9 PM

def mp(n, r):
    from functools import lru_cache

    p = [0] * (n + 1)
    for i in range(n):
        p[i + 1] = p[i] + r[i]

    @lru_cache(None)
    def f(l, r):
        if l == r:
            return 0
        mX = 0
        for m in range(l, r):
            s1, s2 = p[m + 1] - p[l], p[r + 1] - p[m + 1]
            if s1 > s2:
                mX = max(mX, f(m + 1, r) + s2)
            elif s1 < s2:
                mX = max(mX, f(l, m) + s1)
            else:
                mX = max(mX, f(m + 1, r) + s2, f(l, m) + s1)
        return mX

    print(f(0, n - 1))

n = int(input())
r = list(map(int, input().split()))
mp(n, r)

😬 9 AM -- 12pm -- 3pm--6 pm --- 9 PM