首页 > 代码库 > POJ 1631 Bridging signals
POJ 1631 Bridging signals
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.
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
最长公共子序列!!!!!!
由于p<=40000,使得传统的O(n*n)算法行不通了!!!
这里推荐一种O(nlogn)算法。
AC代码如下:
#include<iostream> #include<cstring> #include<algorithm> using namespace std; int dp[40005]; int a[40005]; int dich(int l,int r,int i) { int mid; while(r>l) { mid = (l+r)/2; if(a[i]<=dp[mid]) r=mid; else l=mid+1; } return l; } int main() { int i,j; int t; int n; cin>>t; while(t--) { cin>>n; for(i=1;i<=n;i++) { cin>>a[i]; } dp[1]=a[1]; int top=1; for(i=2;i<=n;i++) { if(a[i]>dp[top]) { dp[++top]=a[i]; } else { int ans=dich(1,top,i); dp[ans]=a[i]; } } cout<<top<<endl; } return 0; }
POJ 1631 Bridging signals
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。