HDU1950-Bridging signals(最长上升子序列)
2016-06-05 19:49
429 查看
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?
![](https://oscdn.geek-share.com/Uploads/Images/Content/201507/30/f6784723bd0c0f6a357c83b0d22f4b3b.jpg)
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
64 2 6 3 1 5
10
2 3 4 5 6 7 8 9 10 18
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 <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; }
相关文章推荐
- C++第七次上机作业
- 各种常用计算机视觉库
- ubuntu禁用guest账户
- C++之关联容器(associative - container)简介
- JavaScript与FireFox的不解之缘——错误处理与调试
- C++作业7—最大公约和和最小公倍数/特殊三位数
- Java集合---HashMap源码剖析
- SQL知识
- EF中生成edmx文件的俩种方式
- 词袋模型和词向量模型
- 超级数组
- C++第七次上机实验
- 软件工程学习总结篇
- Android netd和Framework以及netd和kernel之间的通信
- 编译器的工作过程
- hibernate框架
- 学习进度条十三
- SQL 语句大全
- 异常
- 利用JavaScript DOM 检查表单