题目链接:
计算机软件能力认证考试系统http://118.190.20.162/view.page?gpid=T93
【分析】这道题前面按照规则来写就行,后面的连续三棵树我是用的字典来判断,遍历字典中的键,看比他大1和大2的是否在字典中,如果键是n则找1和2,n-1找n和1。
n = int(input())
t, e = 0, 0
dict = {}
for i in range(1, n + 1):
row = [int(_) for _ in input().split()]
a = 0
for j in range(1, len(row)):
if row[j] > 0:
if a > row[j]:
dict[i] = dict.get(i,0) + 1
a = row[j]
else:
a += row[j]
t += a
for k in dict.keys():
if k == n - 1:
if n in dict and 1 in dict:
e += 1
elif k == n:
if 1 in dict and 2 in dict:
e += 1
else:
if k + 1 in dict and k + 2 in dict:
e += 1
print(t, len(dict), e)