POJ1631 Bridging signals(DP类似最长子序列)
2010-04-07 22:04
411 查看
Bridging signals
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 the signals, using the third dimension, so that no two signals cross. However, bridging is a complicated operation, and thus it is desirable to bridge as few signals as possible. The call for a computer program that finds the maximum number of signals which may be connected on the silicon surface without crossing each other, is imminent. Bearing in mind that there may be thousands of signal ports at the boundary of a functional block, the problem asks quite a lot of the programmer. Are you up to the task?
A typical situation is schematically depicted in figure 1. The ports of the two functional blocks are numbered from 1 to p, from top to bottom. The signal mapping is described by a permutation of the numbers 1 to p in the form of a list of p unique numbers in the range 1 to p, in which the i:th number specifies which port on the right side should be connected to the i:th port on the left side.Two signals cross if and only if the straight lines connecting the two ports of each pair do.
Input
On the first line of the input, there is a single positive integer n, telling the number of test scenarios to follow. Each test scenario begins with a line containing a single positive integer p < 40000, the number of ports on the two functional blocks. Then follow p lines, describing the signal mapping:On the i:th line is the port number of the block on the right side which should be connected to the i:th port of the block on the left side.
Output
For each test scenario, output one line containing the maximum number of signals which may be routed on the silicon surface without crossing each other.
Sample Input
Sample Output
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 5155 | Accepted: 2849 |
'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 the signals, using the third dimension, so that no two signals cross. However, bridging is a complicated operation, and thus it is desirable to bridge as few signals as possible. The call for a computer program that finds the maximum number of signals which may be connected on the silicon surface without crossing each other, is imminent. Bearing in mind that there may be thousands of signal ports at the boundary of a functional block, the problem asks quite a lot of the programmer. Are you up to the task?
A typical situation is schematically depicted in figure 1. The ports of the two functional blocks are numbered from 1 to p, from top to bottom. The signal mapping is described by a permutation of the numbers 1 to p in the form of a list of p unique numbers in the range 1 to p, in which the i:th number specifies which port on the right side should be connected to the i:th port on the left side.Two signals cross if and only if the straight lines connecting the two ports of each pair do.
Input
On the first line of the input, there is a single positive integer n, telling the number of test scenarios to follow. Each test scenario begins with a line containing a single positive integer p < 40000, the number of ports on the two functional blocks. Then follow p lines, describing the signal mapping:On the i:th line is the port number of the block on the right side which should be connected to the i:th port of the block on the left side.
Output
For each test scenario, output one line containing the maximum number of signals which may be routed on the silicon surface without crossing each other.
Sample Input
4 6 4 2 6 3 1 5 10 2 3 4 5 6 7 8 9 10 1 8 8 7 6 5 4 3 2 1 9 5 8 9 2 3 1 7 4 6
Sample Output
3 9 1 4
和最长子序列有点类似,呵呵 卡了我很久了 N^2的时间是毋庸置疑的超时,没办法 一定要使用二分 用了一点技巧 就是用
data数组来保存,也就是说data[2]=3的话说明最长不相交的数是2 而对应最早达到这个条件的左边的点是3.
#include <iostream> using namespace std; int a,n,data[40001]; int main() { int t;scanf("%d",&t); while(t--) { int i,j,ans=1,l,r;scanf("%d",&n); data[1]=1000000; for(i=1;i<=n;i++) { scanf("%d",&a); //data[i]=1; if(i==1) { data[1]=min(data[1],a); continue; } l=1;r=ans; while(l<=r) { int mid=(l+r)/2; if(data[mid]<a) l=mid+1; else r=mid-1; } data[l]=a; ans=max(ans,l); } printf("%d/n",ans); } return 0; }[/code]
相关文章推荐
- POJ 1631 Bridging signals(优化的最长子序列)
- poj 1631 Bridging signals (LIS 最长递增子序列 DP-二分)
- POJ_2533 Longest Ordered Subsequence【DP】【最长上升子序列】
- POJ1159 回文数(DP基础题目)+POJ3991(类似题目)
- nyoj44 nyoj17 HDU1087 DP动规 连续字符串的和最大值 单调递增最长子序列 单调递增子序列最小个数 非连续最大递增子序列
- 单调递增最长子序列DP+二分
- hdu 1003/poj 1050 连续子序列最大和经典基础dp
- poj 1837 dp有点类似背包
- 经典算法 | 使用DP求解数组中最长子序列的个数
- POJ-1631-Bridging signals-( 水LIS-O(nlogn) -DP)
- nyoj17 单调递增最长子序列(DP)
- POJ2479 Maximum sum 最长连续子序列[DP]
- (二分+dp) poj 1631 Bridging signals
- POJ 1745 Divisibility 类似0-1背包DP
- [算法] poj 3903 最长上升子序列 dp vs (二分 nlogn)
- Poj 1631 Bridging signals(二分+DP 解 LIS)
- POJ 2479 + POJ 2593(DP 最大双子序列 ^_^)
- 动态规划:ZOJ1074-最大和子矩阵 DP(最长子序列的升级版)
- NYOJ 17 单调递增最长子序列(基础dp)
- POJ 1952 BUY LOW BUY LOWER 【DP】最长降序子序列及其计数问题