POJ - 1631-Bridging signals (LIS二分模板题)
2018-02-01 20:12
411 查看
‘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
二分算法是不能变的
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
二分算法是不能变的
#include <cstdio> #include <algorithm> #include <cstring> using namespace std; int g[100005],len; int erfen(int low,int high,int key) { while(low<high) { int mid = (low + high)>>1; if(key>g[mid]) low = mid+1; else high= mid; } return low; } int main() { int j,n,tem,t; scanf("%d",&t); while(t --) { scanf("%d",&n); scanf("%d",&tem); g[1]=tem,len=1; for(int a = 1; a < n; a ++) { scanf("%d",&tem); if(tem>g[len]) j = ++len; else j = erfen(1,len+1,tem); g[j]=tem; } printf("%d\n",len); } return 0; }
相关文章推荐
- POJ 1631 Bridging signals(LIS 二分 快速方法)
- HDU 1950 POJ 1631 Bridging signals【LIS,二分优化】
- POJ - 3903-Stock Exchange(LIS二分模板题)
- POJ 1631 LIS 模板题
- [POJ](1631)Bridging signals ---- LIS+O(nlogn)优化(二分)
- Poj 1631 Bridging signals(二分+DP 解 LIS)
- Poj 1631 Bridging signals(二分+DP 解 LIS)
- poj 1631 Bridging signals (LIS 最长递增子序列 DP-二分)
- POJ 3041 Asteroid (二分匹配模板-二分图最小覆盖)
- poj 1631 Bridging signals LIS 最长非递减子序列
- POJ 2976 Dropping tests 01分数规划 模板 二分&&Dinkelbach
- UVA 11368 & POJ 3636 & HDU 1677 Nested Dolls(贪心 + 二分LIS)
- poj 2391 二分+最大流 (dinic模板+优化)
- POJ 1631 Bridging signals(LIS)
- Poj 1631 Bridging signals (LIS, nlog(n))
- poj 1631 Bridging signals (LIS 之 n×logn 算法)
- poj 1631 LIS
- poj1631 dp 最长上升子序列LIS
- (经典)POJ-1631 LIS,偏序问题
- POJ 1631 Bridging signals LIS(最长递增子序列) +nlogn算法+二分查找