poj-1631Bridging signals(LIS)
2015-11-05 17:12
309 查看
Bridging signals
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 crossing each other, is imminent. Bearing in mind that there may be thousands 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?
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 specifies 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
Sample Output
裸lis
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 12202 | Accepted: 6654 |
'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 crossing each other, is imminent. Bearing in mind that there may be thousands 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?
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 specifies 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
裸lis
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int main() { int n,i,j,t,l,dp[40100],N; scanf("%d",&N); while(N--) { int top=0; scanf("%d",&n); scanf("%d",&dp[0]); for(i=1;i<n;i++) { scanf("%d",&t); if(dp[top]<t) dp[++top]=t; else { int l=0,r=top; while(l<=r) { int mid=(l+r)/2; if(dp[mid]<t) l=mid+1; else r=mid-1; } dp[l]=t; } } printf("%d\n",top+1); } return 0; }
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int main() { int n,i,j,t,l,dp[40100],N; scanf("%d",&N); while(N--) { int top=0; scanf("%d",&n); scanf("%d",&dp[0]); for(i=1;i<n;i++) { scanf("%d",&t); if(dp[top]<t) dp[++top]=t; else { int l=upper_bound(dp,dp+top,t)-dp; dp[l]=t; } } printf("%d\n",top+1); } return 0; }
相关文章推荐
- 重装系统,如何备份itune 文件
- 倒计时按钮
- java学习笔记.08——递归
- [BZOJ 2079] Poi 2010 Guilds · 思路题
- ubuntu 下安装python,opencv
- hdoj 1176免费馅饼【dp】
- 关于HTTP的工作原理
- MJExtension使用说明书
- 黑马程序员——JAVA基础----语法(二)-- 流程控制
- Express优化-合并路由
- 使用eclipse开发Java web应用
- SpringMVC绑定到实体数组、list、set、和map时要注意
- sql点滴39—解决数据库日志文件过大的问题
- 机器学习 SURF 描述子详述
- PASSION之Nginx+Tomcat集群搭建(一)
- UltraEdit-15.1-0.0在centos6.5上破解方法
- thinkpad x230----start windows 后屏幕是黑色? 但安全模式可以进入?
- C经典面试题,下面的代码的目的是使字符串倒序,如“abcd”倒序后变为"dcba",请找出错误,并改正
- spark python例子
- NSString