历年题解 CCF CSP历年题解(python)
![](https://img.laitimes.com/img/_0nNw4CM6IyYiwiM6ICdiwiIyVGduV2YfNWawNCM38FdsYkRGZkRG9lcvx2bjxiNx8VZ6l2cs0TPn10dRRUT1kFROBDOsJGcohVYsR2MMBjVtJWd0ckW65UbM5WOHJWa5kHT20ESjBjUIF2X0hXZ0xCMx81dvRWYoNHLrdEZwZ1Rh5WNXp1bwNjW1ZUba9VZwlHdssmch1mclRXY39CXldWYtlWPzNXZj9mcw1ycz9WL49zZuBnLykTMyIjMxYTM4ATMwEjMwIzLc52YucWbp5GZzNmLn9Gbi1yZtl2Lc9CX6MHc0RHaiojIsJye.png)
样例输入:
3 3
73 -8 -6 -4
76 -5 -10 -8
80 -6 -15 0
2 2
10 -3 -1
15 -4 0
题目链接:201909-1小明种苹果
问题分析: 逐行求出每棵树剩余苹果个数,和疏果个数,疏果个数比之前树疏果个数多,则替换并记录该树编号
满分例程:
n,m=input().split()
n,m=int(n),int(m)
T=0#苹果树剩下苹果总数
k=0#疏果数最多的树编号
P=0#疏果数最多
for i in range(n):
sg=0
l=list(map(int,input().split()))
for j in range(1,m+1):
sg+=l[j]
T=T+l[0]+sg
if P<abs(sg):
k=i+1
P=abs(sg)
print(T,k,P)