UVA10534

最新推荐文章于 2021-01-30 23:15:49 发布

ZxXxZxXxZxXxZ

最新推荐文章于 2021-01-30 23:15:49 发布

阅读量1.2k

点赞数

分类专栏：题解

本文链接：https://blog.csdn.net/mad_boys/article/details/47729575

版权

博客内容讲述了如何解决UVA10534问题，即找到数字串中满足长度为奇数，前半部分严格递增，后半部分严格递减的最长子串。文章提到最初的LIS（Longest Increasing Subsequence）解决方案会导致时间超限，因此提出了一个nlogn的优化算法。算法中使用len数组记录正向扫描时的最长递增子序列，并通过二分查找处理反向扫描，以确定每个元素对应的最长递增子序列长度。

摘要由CSDN通过智能技术生成

Wavio is a sequence of integers. It has some interesting properties.
• Wavio is of odd length i.e. L = 2 ∗ n + 1.
• The ﬁrst (n + 1) integers of Wavio sequence makes a strictly increasing sequence.
• The last (n + 1) integers of Wavio sequence makes a strictly decreasing sequence.
• No two adjacent integers are same in a Wavio sequence.
For example 1, 2, 3, 4, 5, 4, 3, 2, 0 is an Wavio sequence of length 9. But 1, 2, 3, 4, 5, 4, 3, 2, 2 is
not a valid wavio sequence. In this problem, you will be given a sequence of integers. You have to ﬁnd
out the length of the longest Wavio sequence which is a subsequence of the given sequence. Consider,
the given sequence as :
1 2 3 2 1 2 3 4 3 2 1 5 4 1 2 3 2 2 1.
Here the longest Wavio sequence is : 1 2 3 4 5 4 3 2 1. So, the output will be ‘9’.
Input
The input ﬁle contains less than 75 test cases. The description of each test case is gi