HDU1950:Bridging signals(LIS)
来源:互联网 发布:北京语言大学网络教育 编辑:程序博客网 时间:2024/06/08 19:14
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
4642631510234567891018876543219589231746
Sample Output
3914
有顺序地保持不许相交,做法跟HDU1025完全一样
二分查找的LIS
#include<stdio.h>int num[40005], dp[40005];int main(){freopen("testin.txt", "r", stdin);freopen("testout.txt", "w", stdout);int n, t;int low, up, mid, len;scanf("%d", &t);while (t--){scanf("%d", &n);for (int i = 1; i <= n; i++)scanf("%d", num + i);len = 1;dp[1] = num[1];for (int i = 2; i <= n; i++){low = 1; up = len;while (low <= up){mid = (up + low) / 2;if (dp[mid] < num[i])low = mid + 1;elseup = mid - 1;}dp[low] = num[i];if (low>len) len++;}printf("%d\n", len);}return 0;}
0 0
- HDU1950:Bridging signals(LIS)
- HDU1950:Bridging signals(LIS)
- HDU1950 Bridging signals 裸LIS
- HDU1950 Bridging signals LIS优化
- hdu1950 Bridging signals (nlogn的lis)
- HDU1950[Bridging signals] LIS模型 (nlogn)
- HDU1950:Bridging signals
- 【DP】HDU1950 Bridging signals——LIS最大上升子序列算法
- HDOJ Bridging signals 【LIS】
- Bridging signals ZOJ 3627 POJ1631 HDU1950
- HDU1950-Bridging signals-最长上升子序列
- POJ 1631 Bridging signals(LIS)
- poj-1631Bridging signals(LIS)
- HDOJ 1950 Bridging signals(LIS)
- HDU 1950 Bridging signals (LIS)
- HDU 1950 - Bridging signals(LIS)
- hdu1950 Bridging signals(最长递增子序列二分)
- HDU1950-Bridging signals(最长上升子序列)
- Ubuntu再体验之【影音】--安装深度音乐、深度影音
- POJ 2406 后缀数组:求连续重复子串
- 经典箴言和人生感悟
- Android 学习之路--也许就是你需要的
- 关于线程
- HDU1950:Bridging signals(LIS)
- php应用篇-百度图片的防盗链
- 安装TortoiseSVN遇到无法通过Windows Istaller服务器安装此安装序包...解决办法
- PC装OSX10.9
- oracle专用模式(DEDICATED) 和 共享模式(SHARE)
- POJ 3096 Surprising Strings 【STL】
- 为什么codeigniter 会出现这个 Disallowed Key Characters 错误提示
- 浅谈Android五大布局—LinearLayout、FrameLayout、AbsoulteLayout、RelativeLayout和TalbeLayout。
- poj 1166 敌兵布阵 线段树