import sys n = int(sys.stdin.readline().strip()) l = [] for _ in range(n): l.append(list(map(int, sys.stdin.readline().strip().split()))) res = [] path = [] def dps(l, i, preposition, path): if len(path) == n: print(path) res.append(sum(path)) else: if len(l[i]) == 1: path.append(l[i][preposition]) dps(l, i + 1, preposition, path) if 0 <= preposition - 1: path.append(l[i][preposition - 1]) dps(l, i + 1, preposition - 1, path) path.pop() if preposition + 1 < len(l[i]): path.append(l[i][preposition + 1]) dps(l, i + 1, preposition + 1, path) path.pop() dps(l, 0, 0, path) print(max(res)) 有没有大佬帮我看看,谢谢
点赞 评论

相关推荐

牛客网
牛客企业服务