Deloitte | COGNIZANT | IBM | CAPGEMINI
def max_points(points):
n = len(points)
if n == 0:
return 0
if n == 1:
return points[0]
dp = [0] * n
dp[0] = points[0]
dp[1] = max(points[0], points[1])
for i in range(2, n):
dp[i] = max(dp[i-1], points[i] + dp[i-2])
return dp[-1]
n = int(input())
points = list(map(int, input().split()))
print(max_points(points))
q2
//quantiphi ✅
1.2K ·