AC代码 第一题 ```python def solve(n, nums): pre = [0] * 3 nums = list(zip(nums[0], nums[1], nums[2])) for i in range(1, n): cur = [0, 0, 0] for j in range(3): cur[j] = min( abs(nums[i][j] - nums[i - 1][0]) + pre[0], abs(nums[i][j] - nums[i - 1][1]) + pre[1], abs(nums[i][j] - nums[i - 1][2]) + pre[2] ) pre = cur return min(pre) if __name__ == '__main__': n = int(input()) res = [] for i in range(3): res.append(list(map(int, input().split()))) print(solve(n, res)) ```