3218. 切蛋糕的最小总开销 I
Medium | Array, Two Pointers, Dynamic Programming, Greedy, Sorting
Dynamic Programming
3225. 网格操作的最大分数
Hard | Array, Dynamic Programming, Matrix, Prefix Sum
3229. 使数组等于目标数组所需的最少操作数
Hard | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack
3241. 标记所有节点所需的时间
Hard | Dynamic Programming, Tree, Depth-First Search, Graph Theory
3250. 单调对的数目 I
Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sum
3251. 单调数对的数目 II
Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sum
3256. 通过放置三个车获得的最大价值和 I
Hard | Array, Dynamic Programming, Matrix, Enumeration
3257. 通过放置三个车获得最大价值和 II
Hard | Array, Dynamic Programming, Matrix, Enumeration
3259. 两种饮品的最大能量提升
Medium | Array, Dynamic Programming
3260. 找到能被 K 整除的最大回文数
Hard | Math, String, Dynamic Programming, Greedy, Number Theory