四十道选择题,数学,数据结构,代码,cv等等。code1:len(nums)=n的数组,数组划分为k段后,求各段权重之和的最大值。动态规划,感觉很难,很难想到怎么构造dp状态和转移方程最后还有注意去重 n,k = map(int, input().split()) arr = list(map(int,input().split())) sum_val = [[0]*n for _ in range(n)] for l in range(n): seen = set() total = 0 for r in range(l,n): if arr[r] not in seen: total +=...