【marscode 动态规划专题】Q2 Q11

Author: Iron-Buster

py_code/动态规划/marscode/marscode_11.py

@@ -0,0 +1,17 @@
+def solution(values: list) -> int:
+    # PLEASE DO NOT MODIFY THE FUNCTION SIGNATURE
+    # write code here
+
+    # values[i] + values[j] + i - j
+    # -> values[j] - j + values[i] + i
+    lmx = values[0]
+    ans = 0
+    for i in range(1, len(values)):
+        ans = max(ans, lmx + values[i] - i)
+        lmx = max(lmx, values[i] + i)
+    return ans  # Placeholder return
+
+if __name__ == '__main__':
+    print(solution(values=[8, 3, 5, 5, 6]) == 11)
+    print(solution(values=[10, 4, 8, 7]) == 16)
+    print(solution(values=[1, 2, 3, 4, 5]) == 8)

py_code/动态规划/marscode/marscode_2.py

@@ -0,0 +1,26 @@
+from functools import cache
+
+
+def solution(n, k, data):
+    # Edit your code
+    @cache
+    def dfs(i: int, j: int) -> int:
+        if i >= n: return 0
+        ans = 0x3f3f3f3f
+        if j > 0:
+            # 不购买
+            ans = min(ans, dfs(i + 1, j - 1))
+        for x in range(1, k + 1):
+            if j + x > k: break
+            # 必须消耗一次
+            ans = min(ans, dfs(i + 1, j + x - 1) + (data[i] * x))
+        return ans
+
+
+    res = dfs(0, 0)
+    return res
+
+if __name__ == "__main__":
+    # Add your test cases here
+
+    print(solution(5, 2, [1, 2, 3, 3, 2]) == 9)