这题主要考察动态规划,较简单,注意牛客IO的方式。
代码如下:
N = int(input())#读取数据
if N == 0: print(0)
work = []
for i in range(N):
work.append(list(map(int,input().split())))#读取数据
if N == 1: print(max(work[0][0], work[0][1]))
else:
dp = [0] * (N+1)
dp[1] = max(work[0][0], work[0][1])
for i in range(1,N+1):
dp[i] = max(dp[i-1] + work[i-1][0], dp[i-2]+work[i-1][1])
print(dp[-1])