杭电-1950Bridging signals(LIS)
2015-11-04 17:18
309 查看
Bridging signals
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1258 Accepted Submission(s): 819
[align=left]Problem Description[/align]
'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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
3 9 1 4
就是求最长上升子序列的,但是用一般的O(n*n)会超时
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int a[41000]; int main() { int N,n,i,j,t; scanf("%d",&N); while(N--) { scanf("%d",&n); scanf("%d",&t); a[0]=t; int top=1; for(i=1;i<n;i++) { scanf("%d",&t); if(t>=a[top-1]) a[top++]=t; else { int r=upper_bound(a,a+top-1,t)-a;//这里调用upper_bound函数求出大于t的第一个元素的位置 a[r]=t; } } printf("%d\n",top); } return 0; }
不调用函数,二分法:
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int a[41000]; int main() { int N,n,i,j,t; scanf("%d",&N); while(N--) { scanf("%d",&n); scanf("%d",&t); a[0]=t; int top=1; for(i=1;i<n;i++) { scanf("%d",&t); if(t>=a[top-1]) a[top++]=t; else { int z=0,q=top-1; while(z<=q) { int mid=(z+q)/2; if(a[mid]<t) z=mid+1; else q=mid-1; } a[z]=t; } } printf("%d\n",top); } return 0; }
下面附上一般代码求最长上升子序列:
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int num[41000],b[41000]; int main() { int N,i,j,n; scanf("%d",&N); while(N--) { scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&num[i]); b[0]=1; int max=0; for(i=1;i<n;i++) { b[i]=1; for(j=0;j<i;j++) if(num[i]>=num[j]&&b[i]<b[j]+1) b[i]=b[j]+1; if(b[i]>max) max=b[i]; } printf("%d\n",max); } return 0; }
相关文章推荐
- 数据库隔离级别
- java Serializable和Externalizable序列化反序列化详解--转
- AndroidManifest.xml详解(上)
- 鸟哥的Linux私房菜(基础篇)- 第二十四章、 X Window 配置介绍
- skynet服务的本质与缺陷
- 集成支付宝的相关问题
- Android ScroolView不能撑满全屏的问题
- Exception sending context initialized event to listener instance of class org.emp.utils.InitDataList
- JDK动态代理实现简单AOP--转
- xcode 升级插件失效问题
- 我的博客今天开通了,请多指教!
- [转] Maven镜像配置
- TCP/IP协议原理与应用笔记18:构成子网和超网
- ReactMotion Demo8 分析
- python下运行报"SyntaxError: Non-ASCII character '/xe6' "错误解决方法
- js,window.重定向页面
- 分布式消息队列kafka系列介绍 — 核心API介绍及实例
- 正则表达式--操作字符串a
- 图片轮播添加点击事件遇到的问题
- HDU-3555-数位DP-Bomb