hdu1950二分法的LISS
来源:互联网 发布:华为云计算大会 编辑:程序博客网 时间:2024/06/07 23:37
Bridging signals
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3077 Accepted Submission(s): 1942
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
Source
NWERC2003
Recommend
wangye | We have carefully selected several similar problems for you: 1978 1501 1422 2845 2577
#include<stdio.h>#include<iostream>#include<algorithm>typedef long long ll;const int maxn=400040;using namespace std;int b[maxn];int a[maxn];int LISS(int n)//最长增长序列 {int num=0;for(int i=0;i<n;i++){if(!num||a[i]>=b[num-1]) b[num++] = a[i];else *upper_bound(b,b+num,a[i]) = a[i];//大于的元素的位置指针 }return num;}int main(){int t;int p;scanf("%d",&t);while(t--){scanf("%d",&p);for(int i=0;i<p;i++){scanf("%d",&a[i]);}cout<<LISS(p)<<endl;}}
阅读全文
0 0
- hdu1950二分法的LISS
- HDU1950
- hdu1950
- hdu1950 Bridging signals (nlogn的lis)
- 待字闺中之LISS问题
- 二分法:CF371C-Hamburgers(二分法+字符串的处理)
- hdu1950 poj1631 Bridging signals(n*logn的最长递增子序列)
- 二分法的妙用
- 二分法插入的实现
- 二分法的使用
- 二分法查找的实现
- 二分法的心得
- 编程珠玑的二分法
- 二分法的实现
- 二分法的具体应用
- 最简单的二分法
- 二分法的应用
- 二分法查找的原理
- 网易2018校园招聘编程题真题集合
- SpringBoot注解大全
- 二项式反演
- C语言中关于 LINK : fatal error LNK1561: 必须定义入口点 的解决方法
- 递归-放苹果问题
- hdu1950二分法的LISS
- 苹果Face ID到底安不安全?苹果白皮书给出解释!
- SQL语句之约束
- MDK中armclang编译器
- Java中Iterable和Iterator的辨析
- iconlover中文绿色版V5.46下载 |Icon图标制作工具 | iconlover 注册码
- 聊一聊麦克风阵列技术:语音交互应该选用怎样的方案?|深度
- SQL语句之分页
- 成功人士的9个理财好习惯