帖子def answer(arr, i, dp):

def answer(arr, i, dp): if i >= len(arr): return 0 if dp[i] != -1: return dp[i] include = arr[i] | answer(arr, i + 1, dp) exclude = answer(arr, i + 1, dp) dp[i] = max(include, exclude) return dp[i] def solve(N, arr): dp = [-1] * N return answer(arr, 0, dp) OR Bit ✅ #Seimens