CSP 2019-09-1XiaomingのApplePython実装+詳細な説明

テストの質問

コード

# 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 = 0
    reduceSum = 0
    for j in list2:#对于每一颗果子
        j = int(j)
        reduceSum -= j
    leftTree = int(list1[0]) - reduceSum
    leftTrees += leftTree
    if reduceSum > reduceMaxSum:
        reduceMaxSum = reduceSum
        reduceMaxIndex = i+1

print(leftTrees,reduceMaxIndex,reduceMaxSum)