hdu 1950 Bridging signals 最长上升子序列
2016-03-14 15:06
344 查看
Bridging signals
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1392 Accepted Submission(s): 908
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?
![](http://acm.hdu.edu.cn/data/images/1950-1.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
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
Source
NWERC2003
Recommend
wangye | We have carefully selected several similar problems for you: 1864 1978 1501 1422 2845
#include<cstdio> #include<string> #include<cstring> #include<iostream> #include<cmath> #include<algorithm> using namespace std; typedef long long ll; const int INF =0x3f3f3f3f; const int maxn= 40000 ; int n; struct MyQueue { int front,rear; int q[maxn+10]; void clear() { front=rear=1; } int size() { return rear-front; } int bs(int le,int ri,int x) { while(le<=ri) { int mid=(le+ri)/2; if(q[mid]<x) le=mid+1; else ri=mid-1; } return le; } int insert(int x) { if(x>q[rear-1]||size()==0) { q[rear++]=x; return rear-1; } int p=bs(1,rear-1,x); q[p]=x; return p; } }q; int main() { int T;scanf("%d",&T); while(T--) { scanf("%d",&n); q.clear(); int ans=1; int x; for(int i=1;i<=n;i++) { scanf("%d",&x); ans=max(ans,q.insert(x) ); } printf("%d\n",ans); } return 0; }
相关文章推荐
- 一致性哈希算法
- 深度学习傻瓜教程(1)
- linux下c/c++实例之七递归扫描目录下的文件
- bootstrap-datetimepicker日期时间选择器使用文档
- nfs+ssh软连接无法实现免密码登陆
- 链表基本操作
- 国际会议级别
- lua Date和Time
- 一个及格的java程序员应该有这个能力
- [leetcode] 186. Reverse Words in a String II 解题报告
- setsockopt()函数功能介绍
- Angularjs 实现 $(document).ready()的两种方法
- java面试宝典
- MySQL查询优化之explain的深入解析
- 十六进制数也可以这样输入。。
- 1-管理分支
- skiing
- Github 栈的底端是硬件
- Leet Code OJ 191. Number of 1 Bits [Difficulty: Easy]
- 【树状数组】段改动,点查询