###### wchhlbt的博客

towards world final~

###### POJ 1631 Bridging signals（最长上升子序列 nlgn做法）

Bridging signals
 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 12687 Accepted: 6915

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

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

AC code:

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

const int N = 41000;
int a[N];       //a[i] 原始数据
int d[N];       //d[i] 长度为i的递增子序列的最小值

int BinSearch(int key, int low, int high)//二分查找
{
while(low<=high)
{
int mid = (low+high)>>1;
if(key>d[mid] && key<=d[mid+1])
return mid;
else if(key>d[mid])
low = mid+1;
else
high = mid-1;
}
return 0;
}

int LIS( int n )//n->数列的长度
{
int i,j;
d[1] = a[1];
int len = 1;        //递增子序列长度
for(i = 2; i <= n; i++)
{
if(d[len]<a[i])
j = ++len;
else
j = BinSearch(a[i],1,len) + 1;
d[j] = a[i];
}
return len;
}

int main()
{
//freopen("test.txt","r",stdin);
int t,n,i;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
printf("%d\n",LIS(n));
}
//cout << "Hello world!" << endl;
return 0;
}

#### 最长上升子序列(LIS)长度的O(nlogn)算法

2012-04-18 19:38:13

#### 最长上升子序列nlgn源码

2008年10月18日 972B 下载

#### 最长上升子序列的O(nlgn)解法

2013-12-03 19:17:23

#### 动态规划---最长上升子序列问题（O(nlogn),O(n^2)）

2016-03-21 20:32:37

#### hdu 1950 最长上升子序列 nlogn

2017-03-04 20:25:55

#### 最长上升子序列O(NlogN)算法

2015-08-05 15:36:01

#### uva10534 - Wavio Sequence O(nlgn)的最长上升子序列

2013-10-02 17:35:29

#### LIS 最长上升子序列问题 nlgn时间打印其中一个序列

2015-06-13 11:51:44

#### 【线段树+O(nlgn)最长上升子序列】HDU 3564

2012-02-14 16:19:03

#### POJ 1631(最长上升子序列 nlogn).

2014-08-03 21:06:00

## 不良信息举报

POJ 1631 Bridging signals（最长上升子序列 nlgn做法）