打卡记录

无矛盾的最佳球队（线性DP）

class Solution:def bestTeamScore(self, scores: List[int], ages: List[int]) -> int:n = len(scores)        nums = sorted(zip(scores, ages))f = sorted(scores)for i in range(n):for j in range(0, i):if nums[j][1] <= nums[i][1]:f[i] = max(f[i], f[j] + nums[i][0])return max(f)

背单词的小智（二分 + 贪心）

n, k = map(int, input().split())
a = list(map(int, input().split()))s = [0] * (n + 1)
for i in range(n):s[i + 1] = s[i] + a[i] ** 2def check(x):res = 0i = 0while i < n:start = iif s[start + 1] - s[start] > x:return Falsei += 1while i < n and s[i + 1] - s[start] <= x:i += 1res += 1return res <= kl, r = 0, s[n] - s[0]
while l < r:mid = (l + r) >> 1if check(mid):r = midelse:l = mid + 1
print(l)