njoy613如何通过动态规划免费获得馅饼？

本文共计318个文字，预计阅读时间需要2分钟。

pythondef max_increasing_subsequence_length(sequence): if not sequence: return 0

n=len(sequence) dp=[1] * n

for i in range(1, n): for j in range(i): if sequence[i] > sequence[j]: dp[i]=max(dp[i], dp[j] + 1)

return max(dp)

Example usage:sequence=[1, 2, 3, 2, 5, 4, 6, 7, 8, 9]print(max_increasing_subsequence_length(sequence))

//就想象成t行11列的数，从下往上遍历相加，找最大值。