杭电1950 Bridging signals(二分求最长上升子序列)
2014-11-20 21:48
399 查看
Bridging signals
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 716 Accepted Submission(s): 475
Problem 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 rossing each other, is imminent. Bearing in mind that there may be housands 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?
Figure 1. To the left: The two blocks' ports and their signal mapping (4,2,6,3,1,5). To the right: At most three signals may be routed on the silicon surface without crossing each other. The dashed signals must be bridged.
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 pecifies 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/* 组队赛刚刚清完题,惭愧啊。。唉 Time:2014-11-20 21:47 */ #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int MAX=40000+10; int a[MAX],buf[MAX]; int bSearch(int val,int len){ int l=1,r=len; while(r>=l){ int mid=(l+r)>>1; if(buf[mid]>val){ r=mid-1; }else if(buf[mid]==val){ return mid; }else{ l=mid+1; } } return l; } int main(){ int T,n; scanf("%d",&T); while(T--){ scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%d",&a[i]); } int len=1;buf[1]=a[0];int temp; for(int i=1;i<n;i++){ temp=bSearch(a[i],len);//在a中的位置 buf[temp]=a[i]; if(len<temp) len=temp; } printf("%d\n",len); } return 0; }
相关文章推荐
- HDU-1950-Bridging signals【最长上升子序列(LIS)长度的O(nlogn)算法】
- 【模版】二分查找、最长上升子序列(LIS)、最长下降子序列模版
- ZOJ2283 Challenge of Wisdom(DP+二分求最长非上升子序列)
- UVA 10534 Wavio Sequence(二分 + 最长上升子序列)
- HDU 1025 最长上升子序列变形 (dp+二分)
- 二分求最长上升子序列
- hdu 1950 Bridging signals(最长上升子序列)
- POJ 1631-Bridging signals(最长上升子序列+二分搜索)
- NYOJ 214 最长上升子序列加强版(二分+dp)
- hdu 1950最长单调上升子序列
- 玲珑 1097(不相交的二分匹配->最长上升子序列)@
- POJ2533 -Longest Ordered Subsequence最长上升子序列-动规和nlogn二分算法详解
- HDU 1950 最长上升子序列
- 最长上升子序列——O (nlogn)算法原因解析!为什么这样可以求出来!(附带动态规划dp + 二分查找讲解)
- 最长上升子序列的dp和二分求法
- hdu 5256 序列变换(最长上升子序列&&二分)
- hdu 1025 二分查找+最长上升子序列
- 【最长上升子序列+二分优化】麻烦的聚餐 egroup.pas/c/cpp
- hdu 1950 Bridging signals 最长上升子序列
- HDU 4604 Deque 二分最长上升子序列