poj1631 dp 最长上升子序列LIS

Twenty_seven

于 2015-08-05 21:16:07 发布

阅读量611

点赞数

分类专栏： dp poj/hdu

本文链接：https://blog.csdn.net/Twenty_seven/article/details/47303553

版权

这篇博客介绍了如何使用动态规划（dp）解决POJ1631问题，即找到一个数列的最长上升子序列。博主首先提出了常见的O(n^2)解决方案，但由于数据规模（n=40000）导致超时，然后详细讲解了优化后的O(n log n)算法，通过维护一个单调递增的dp数组，利用二分查找提高效率。代码示例展示了整个过程。

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

如题：http://poj.org/problem?id=1631

Bridging signals

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 11636		Accepted: 6348

Description

'Oh no, they've done it again', cries the chief designer at the Waferland chip factory. Once more the routing designers have screwed up completely, making the signals on the chip connecting the ports of two functional blocks cross each other all over the place. At this late stage of the process, it is too expensive to redo the routing. Instead, the engineers have to bridge