poj1631
来源:互联网 发布:中国国家地理 知乎 编辑:程序博客网 时间:2024/06/05 06:48
Bridging signals
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14594 Accepted: 7895
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 <iostream>#include <stdio.h>#include <algorithm>#include <string.h>#include <cmath>using namespace std;#define ll long long int;#define ma(a) memset(a,0,sizeof(a));int a[400004],dp[400004];int main(){ int T; cin>>T; while(T--) { int n; scanf("%d",&n); int i; for(i=0;i<n;i++) { scanf("%d",&a[i]); } memset(dp, 0x7f, sizeof(dp)); int maxn=0; for(i=0;i<n;i++) { int x=lower_bound(dp,dp+n,a[i])-dp; dp[x]=a[i]; maxn=max(x,maxn); } cout<<maxn+1<<endl; } return 0;}
阅读全文
0 0
- poj1631
- poj1631
- poj1631
- poj1631
- poj1631
- poj1631
- poj1631 Bridging signals
- POJ1631 Bridging signals
- POJ1631 Bridging signals
- POJ1631(裸LIS)
- poj1631 Bridging signals
- Bridging signals||POJ1631
- poj1631——Bridging signals
- DP.單調隊列::poj1631 Bridging signals
- poj1631最长递增字序列
- poj1631基于lower_bound的实现
- poj1631【最长递增子序列】
- 再谈升/降序子序列——POJ1631
- Calendar类
- [LeetCode] 241. Different Ways to Add Parentheses
- 树莓派上截屏的方法
- Android webview加载https网页时http图片无法显示
- java.lang.String中的trim()方法的详细说明
- poj1631
- java 内存 dump内存分析实例
- DNS以及DNS解析
- mac上传本地项目到GitHub
- 递归解释 系统栈
- android 通过uri获取bitmap图片并压缩
- 8.9.1
- HDU1018(斯特林公式)
- FastJson和Jackson的使用