POJ 1631 Bridging signals (dp)
来源:互联网 发布:序列模式数据库 编辑:程序博客网 时间:2024/06/04 08:40
Bridging signals
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11270 Accepted: 6146
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
仔细想想 求所给数列的最长上升子序列 同前一题
AC代码如下:
//// POJ 1631 Bridging signals//// Created by TaoSama on 2015-03-06// Copyright (c) 2015 TaoSama. All rights reserved.//#include <algorithm>#include <cctype>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <string>#include <set>#include <vector>#define CLR(x,y) memset(x, y, sizeof(x))using namespace std;const int INF = 0x3f3f3f3f;const int MOD = 1e9 + 7;const int N = 1e5 + 10;int a[40005], dp[40005];int main() {#ifdef LOCALfreopen("in.txt", "r", stdin);//freopen("out.txt","w",stdout);#endifios_base::sync_with_stdio(0);int t; cin >> t;while(t--) {int n; cin >> n;memset(dp, 0x3f, sizeof dp);int ans = 1;for(int i = 1; i <= n; ++i) {int x; cin >> x;int l = 1, r = ans;while(l <= r) {int mid = (l + r) >> 1;if(dp[mid] < x) l = mid + 1;elser = mid - 1;}dp[l] = x;ans = max(ans, l);}cout << ans << endl;}return 0;}
0 0
- POJ 1631 Bridging signals (dp)
- poj 1631Bridging signals Dp(最长递增子序列)
- POJ-1631-Bridging signals-( 水LIS-O(nlogn) -DP)
- (二分+dp) poj 1631 Bridging signals
- poj 1631 Bridging signals dp LIS
- Bridging signals(DP)
- POJ 1631 Bridging signals
- Bridging signals POJ 1631
- poj 1631 Bridging signals
- poj 1631 Bridging signals
- poj 1631 Bridging signals
- POJ 1631 Bridging signals
- POJ-1631-Bridging signals
- poj 1631--Bridging signals
- POJ 1631 Bridging signals
- POJ 1631 Bridging signals
- poj 1631 Bridging signals
- poj 1631 Bridging signals
- UVa #1629 Cake slicing (习题9-3)
- poj 2594 Treasure Exploration(最小路径覆盖(可重点)+floyd)
- 33333
- POJ 1065 Wooden Sticks (dp)
- 网络营销视频教程(29种营销方法)-免费下载地址整理
- POJ 1631 Bridging signals (dp)
- 日拱一卒(六)
- LeetCode-Binary Tree Inorder Traversal
- Java打包成jar文件,以及jar文件的运行+将jar文件导出为exe文件(看图说)
- C语言中的循环嵌套例子
- POJ 3666 Making the Grade (dp)
- 感想心得
- POJ 2392 Space Elevator (dp)
- Python设计模式——原型模式