计算概论C完美的爱所属作业: hw6 数据结构: 列表 1 2 3 4 5 6 7 8 9 10 11 12 n = int(input()) lst = list(map(int, input().split())) max0 = 0 for i in range(n): for j in range(i + 1, n + 1): lst2 = lst[i:j] if sum(lst2) / len(lst2) == 520: price = sum(lst2) if price > max0: max0 = price print(max0) 用字典做 1 2 3 4 5 6 7 8 9 10 11 12 n = int(input()) lst = list(map(int,input().split())) app = {0: -1} cur = 0 ans = 0 for i in range(len(lst)): cur += lst[i] - 520 if cur in app: ans = max(ans, (i-app[cur])*520) else: app[cur] = i print(ans)