试题

代码

# N,M分别表示树的棵树和疏果轮数
N,M = [int(i) for i in input().split()]leftTrees = 0#最后所有树树上的苹果总数
reduceMaxIndex = 0#疏果个数最多的苹果编号
reduceMaxSum = 0#上面那棵树的个数reduceMaxSum = 0
reduceMaxIndex = 0
leftTrees = 0
for i in range(N):#对于每一棵树list1 = input().split()list2 = list1[1:]leftTree = 0reduceSum = 0for j in list2:#对于每一颗果子j = int(j)reduceSum -= jleftTree = int(list1[0]) - reduceSumleftTrees += leftTreeif reduceSum > reduceMaxSum:reduceMaxSum = reduceSumreduceMaxIndex = i+1print(leftTrees,reduceMaxIndex,reduceMaxSum)