HDU1950-Bridging signals(最长上升子序列)
来源:互联网 发布:js获取用户ip地址 编辑:程序博客网 时间:2024/05/20 19:50
Bridging signals
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1540 Accepted Submission(s): 1010
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.
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
464 2 6 3 1 5102 3 4 5 6 7 8 9 10 188 7 6 5 4 3 2 195 8 9 2 3 1 7 4 6
Sample Output
3914
#include <stdio.h> #include <string.h> #include <algorithm>using namespace std; int a[40005],dp[40005],n; int LIS() { int i,j,ans=1; dp[1] = a[1]; for(i = 2; i<=n; i++) { if(a[i]<=dp[1]) j = 1; else if(a[i]>dp[ans]) j = ++ans; else j = lower_bound(dp+1,dp+1+ans,a[i])-dp; dp[j] = a[i]; } return ans; } int main() { int t,i; scanf("%d",&t); while(t--) { scanf("%d",&n); for(i = 1;i<=n;i++) scanf("%d",&a[i]); printf("%d\n",LIS()); } return 0; }
0 0
- HDU1950-Bridging signals-最长上升子序列
- HDU1950-Bridging signals(最长上升子序列)
- 【HDU1950】Bridging signals (最长上升子序列DP(nlogn))
- hdu1950 Bridging signals(最长递增子序列二分)
- ZOJ3627 POJ1631 HDU1950 Bridging Signals,O(N*logN)版最长上升子序列问题
- UVALive2931 POJ1631 HDU1950 ZOJ1986 Bridging signals【最长上升子序列+二分+堆栈】
- POJ1631 Bridging signals 最长上升子序列
- POJ1631-Bridging signals-最长上升子序列
- 最长上升子序列(LIS)POJ 1631 Bridging Signals
- 【DP】HDU1950 Bridging signals——LIS最大上升子序列算法
- 【最长上升子序列】北大 POJ 1631 Bridging signals
- hdu 1950 Bridging signals--二分法求最长上升子序列
- poj1631 Bridging signals 加强版最长上升子序列
- POJ 1631 Bridging signals(LIS:最长上升子序列)
- poj 1631 Bridging signals【最长上升子序列】
- POJ 1631 —— Bridging signals 最长上升子序列
- hdu 1950 Bridging signals 最长上升子序列
- POJ 1631 Bridging signals 最长上升子序列
- C++第七次上机作业
- 各种常用计算机视觉库
- ubuntu禁用guest账户
- C++之关联容器(associative - container)简介
- 图像特征提取
- HDU1950-Bridging signals(最长上升子序列)
- 百思不得姐项目详细知识点(一)
- 详解--访问HDFS的几种方式
- hdu2167(压缩DP)
- python-开发之路-格式化输入
- Coursera-Machine Learning(第二周 Linear Regression)
- Linux(rhel)根目录下的文件浅析
- Delphi 文件读写
- 事务的基本概念和事务的性质