【HDU1950】Bridging signals (最长上升子序列DP(nlogn))
来源:互联网 发布:java office转换成pdf 编辑:程序博客网 时间:2024/05/20 16:35
这里是题目
Bridging signals
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2893 Accepted Submission(s): 1828
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
具体可以看这篇LIS的模板
这道题就是很直接的lis
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int a[40010],dp[100000];#define INF 0x3f3f3fint main(){ int n; scanf("%d",&n); while(n--) { int m; scanf("%d",&m); for(int i=0;i<m;i++) { scanf("%d",&a[i]); dp[i]=INF; } for(int i=0;i<m;i++) { *lower_bound(dp,dp+m,a[i])=a[i]; } printf("%d\n",lower_bound(dp,dp+m,INF)-dp); }return 0;}
- 【HDU1950】Bridging signals (最长上升子序列DP(nlogn))
- HDU1950-Bridging signals-最长上升子序列
- HDU1950-Bridging signals(最长上升子序列)
- hdu1950 Bridging signals(最长递增子序列二分)
- 【HDU 1950】 Bridging signals (最长上升子序列nlogn算法)(二分,动态规划)
- ZOJ3627 POJ1631 HDU1950 Bridging Signals,O(N*logN)版最长上升子序列问题
- UVALive2931 POJ1631 HDU1950 ZOJ1986 Bridging signals【最长上升子序列+二分+堆栈】
- 【DP】HDU1950 Bridging signals——LIS最大上升子序列算法
- POJ1631 Bridging signals 最长上升子序列
- POJ1631-Bridging signals-最长上升子序列
- 最长上升子序列(LIS)POJ 1631 Bridging Signals
- pku 1631 Bridging signals nLogn效率的最长上升子序列
- HDU-1950-Bridging signals【最长上升子序列(LIS)长度的O(nlogn)算法】
- hdu 1950 Bridging signals 最长上升序列nlogn
- poj 1631Bridging signals Dp(最长递增子序列)
- HDU 1950(Bridging signals)最长不降子序列nlogn
- 最长上升子序列(LIS)长度 O(nlogn)算法 hdu1950为例
- POJ 1631 Bridging signals 解题报告(附详细分析)最长上升子序列的dp+二分
- Hadoop(4-2)-MapReduce程序案例-WordCount(Intellij Idea环境)
- spring boot:No converter found for return value of type: class另类解决办法
- ubuntu16.04安装qt5
- Leetcode655. Print Binary Tree
- codeforces 339D 简单的线段树操作
- 【HDU1950】Bridging signals (最长上升子序列DP(nlogn))
- AFNetworking 请求工具类
- 为什么RegExp.prototype.exec()的返回值会变化
- 【矩阵快速幂】HDU_2157_How many ways??
- 高速缓存区dns
- [BZOJ1004][HNOI2008]Cards-Burnside引理
- Matlab中的静态变量和全局变量
- Spring AOP原理分析一次看懂
- react-navigation