POJ 2533 最长上升子序列（dp）

最新推荐文章于 2021-02-28 17:00:04 发布

淼润淽涵

最新推荐文章于 2021-02-28 17:00:04 发布

阅读量210

点赞数

分类专栏：学习总结动态规划文章标签： dp 学习总结

本文链接：https://blog.csdn.net/wcxyky/article/details/89295650

版权

这篇博客介绍了如何使用动态规划（DP）解决POJ 2533问题，即找到一个数列的最长上升子序列的长度。通过输入数据格式和输出要求，博主分享了求解思路和完整的代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem Description

A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence ( a1, a2, ..., aN) be any sequence ( ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).

Your program, when given the numeric sequence, must find the length of its longest ordered subsequen.

Input

The first line of input file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000