第一题全AC Python代码 n = int(input()) s = list(map(int, input().split(' '))) def sol(n, s): if n == 1: return s[0] ret = 0 t = float('inf') min_index = None for i, v in enumerate(s): if v < t: t = v min_index = i if min_index == 0: return s[0] * n ret = t * (n - min_index) return ret + sol(min_index, s[:min_index]) print(sol(n, s))