C语言动态规划(1)___Bridging signals
来源:互联网 发布:天思软件集团 编辑:程序博客网 时间:2024/05/01 14:10
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.
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
4642631510234567891018876543219589231746
Sample Output
3914
样例:
#include <stdio.h>int f[40010];int longest(int a,int l,int r) //定义二分查找函数{int m;while(l<=r){m=(l+r)/2;if(f[m]==a) //如果出现当前值和查找的值相同那么自然就更新当前的f[]值,也可理解为不用更新{l=m;return l;}else if(f[m]>a)r=m-1;elsel=m+1;}return l; //每次返回的都是在f[]中最大的j能够使得f[j]<a[i]的j+1.}int main(){int N,n,a,i,t,k,j;scanf("%d",&N);while(N--){t=0;scanf("%d",&n);for(i=0;i<n;i++){scanf("%d",&a); //每次输入一个数就处理一个数k=longest(a,1,t);if(k<=t) //如果k<=t说明是情况3.f[k]=a;else //否则为情况1,表示最大长度可以更新{t++;f[t]=a;}}printf("%d\n",t);}return 0;}
题目大概意思:
先输入一个数N表示有N组测试数据
每组数据先输入一个数n表示有n个
接下来的n排分别表示左边1~n与右边的连接序号.
输出最多有多少不交叉的连接.
这道题实质就是数列中最长不下降子序列问题. 具体:(2)最长不下降子序列问题____动态规划
1 0
- C语言动态规划(1)___Bridging signals
- [动态规划]PKU Bridging signals
- 动态规划C语言初学
- POJ1631——Bridging signals(动态规划)
- 0-1背包问题(动态规划C语言实现)
- C语言动态规划(2)___Maximum sum
- C语言实现 poj3666(动态规划)
- poj1661-帮助jimmy-C语言-动态规划
- poj 1631 || hdu 1950 Bridging signals(动态规划:LIS)
- HDU 1950 Bridging signals ( DP动态规划 O(n^2) )
- Bridging signals 最长上升序列+动态规划+二分
- C语言实现之三角形问题(非动态规划方法)
- C语言 枚举法,分治法,动态规划
- 算法导论 之 动态规划 - 装配线调度问题[C语言]
- C语言动态规划(3)___Filthy Rich(Hdu 2391)
- C语言动态规划(4)___Sumsets(Hdu 2709)
- C语言动态规划(5)___FATE(Hdu 2159)
- C语言动态规划(6)___传纸条(Vijos P1493)
- bzoj 1088 简单dfs
- DHCP Client 服务和下列不存在的服务存在相依的关系: Tdx
- ubuntu系统下 配置apache+redmine
- sql 索引
- POJ 1363 Rails
- C语言动态规划(1)___Bridging signals
- SQL测试+TABLE动态创建
- magento lazyload解决方案
- 野指针与非法内存操作
- dom4j解析xml文件
- Java多线程编程中生产者-消费者模式的详解
- 软件文档写作——项目建议书
- 最简单的jquery导航,感谢csdn上的大神帮忙
- 创业者该如何设计公司的股权架构