201909-2 CCF认证考试 小明种苹果（续）Python版

第一题：小明种苹果

第二题：

这道题个人认为难点在第一：如何将除第一行外数据存储，第二：苹果数要用最后一个正整数减去正整数后面的，这一点怎么判断，第三相邻的判断

我的解决方法：第一：用多维数组，第二开始用第一个统计的减，然后判断当有了新的正整数进行替换再接着减，第三，将掉落苹果的树标签存入数组即可直接判断

ps：这道题有一个坑就是一棵树可能不止一次掉落，所以需要加一个判断条件不然就只有50分

满分答案：

N = input()
N = int(N)
apple = [[0] for i in range(N)]
drop_tree = []
sum_apple = 0
drop_sum = 0
three = 0
for i in range(N):
	apple[i] = input().split()
for i in range(N):
	ff = int(apple[i][1])
	c = 0
	for j in range(int(apple[i][0]) - 1):
		a = int(apple[i][j+2])
		if a < 0:
			ff = ff + a
		if a > 0:
			ff_ori = ff
			ff = a
			if ff_ori > ff and c == 0:
				c = 1
				drop_sum = drop_sum + 1
				drop_tree.append(i)
	sum_apple = sum_apple + ff
if (0 in drop_tree) and (1 in drop_tree) and (N-1 in drop_tree):
	three = three + 1
if (0 in drop_tree) and (N-1 in drop_tree) and (N-2 in drop_tree):
	three = three + 1
for j in range(N):
	if (j in drop_tree) and (j+1 in drop_tree) and (j+2 in drop_tree):
		three = three + 1
print(sum_apple,drop_sum,three)