vault backup: 2026-05-16 14:33:21
This commit is contained in:
@@ -48,7 +48,7 @@ create time: 2026-05-16 14:35
|
||||
|
||||
转移方程:
|
||||
|
||||
\[dp[i] = \max_{j < i, \; nums[j] < nums[i]}(dp[j]) + 1\]
|
||||
$$dp[i] = \max \{ dp[j] \} + 1, \quad j < i,\; nums[j] < nums[i]$$
|
||||
|
||||
回溯时,从 dp 值最大的位置倒推,找到前驱元素即可恢复完整子序列。
|
||||
|
||||
|
||||
Reference in New Issue
Block a user