POJ 1631 Bridging signals(最长上升序列)
来源:互联网 发布:如何利用网络招聘 编辑:程序博客网 时间:2024/04/20 14:11
Bridging signals
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11705 Accepted: 6391
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
4642631510234567891018876543219589231746
Sample Output
3914
#include <iostream>#include <cstdio>#include <string.h>using namespace std;const int N=40000+5;int dp[N]; //长度为i的最长上升序列的结尾最小值 int a[N]; int find(int len,int n)//修改后的二分查找,若返回值为x,则a[x]>=n { int left=0,right=len,mid=(left+right)/2; while(left<=right) { if(n>dp[mid]) left=mid+1; else if(n<dp[mid]) right=mid-1; else return mid; mid=(left+right)/2; } return left; //如果到最后还没找到 返回最靠近左边 因为要小的 }int main(){int n,t,i,len,j;cin>>t;while(t--){cin>>n;for(i=0;i<n;i++)cin>>a[i];len=1; //已有的升序序列长度 dp[1]=a[0];for(i=1;i<n;i++){ j=find(len,a[i]); dp[j]=a[i]; if(j>len) len=j;//更新len //要更新len,另外补充一点:由二分查找可知j只可能比len大1 }cout<<len<<endl; }return 0;}
0 0
- POJ 1631 Bridging signals(最长上升序列)
- 【最长上升子序列】北大 POJ 1631 Bridging signals
- POJ 1631 Bridging signals(LIS:最长上升子序列)
- poj 1631 Bridging signals【最长上升子序列】
- POJ 1631 —— Bridging signals 最长上升子序列
- 最长上升子序列(LIS)POJ 1631 Bridging Signals
- POJ 1631 Bridging signals 最长上升子序列
- poj-1631-Bridging signals-最长上升序列(LIS)
- POJ-163--Bridging signals最长上升子序列
- POJ 1631 Bridging signals(最长上升子序列 n*logn && POJ 3903)
- zoj 1986 || poj 1631 Bridging Signals(最长上升子序列N*logN)
- poj 1631 Bridging signals 最长上升子序列的O(n*lgn)方法
- POJ 1631-Bridging signals(最长上升子序列+二分搜索)
- POJ 1631 : Bridging signals - 最长上升子序列 O(nlog n)
- POJ 1631 Bridging signals(最长上升子序列 nlgn做法)
- POJ1631 Bridging signals 最长上升子序列
- HDU1950-Bridging signals-最长上升子序列
- POJ1631-Bridging signals-最长上升子序列
- 基于火狐和谷歌浏览器的html5调用摄像头
- 【整蛊代码】说我是傻子,不说xx秒就强制关机
- Java之面向对象详细总结
- OPENGL_三角形带GL_TRIANGLE_STRIP详解
- 2014华为机试(3)
- POJ 1631 Bridging signals(最长上升序列)
- 如何走好第一步
- myeclipse新手开发快捷键(更新中)
- POJ 1170 暴搜+dp剪枝优先队列+状压
- 利用.bat(批处理)来删除KEIL编译生成的无用文件
- 我在武汉新东方上过的8个老师
- python--有关函数的问题
- 黑马程序员——Java基础04(数组)
- UVALive - 4043 Ants (二分图最大权匹配)