poj 1631 Bridging signals (二分||DP||最长递增子序列)
2013-07-17 12:25
441 查看
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
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 9234 | Accepted: 5037 |
'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 思路: 最长递增子序列: (二分)代码:
#include<iostream> #include<stdio.h> int arr[40010]; int search(int a,int b,int n){ //二分 int mid; while(a<=b){ mid = (a+b)/2; if(n>arr[mid]){ a = mid + 1; }else{ b = mid - 1; } } return b; } int main(){ int t; scanf("%d",&t); while(t--){ int n,i; scanf("%d",&n); scanf("%d",&arr[0]); int pos=1; for(i=1;i<n;i++){ scanf("%d",&arr[pos]); if(arr[pos]>=arr[pos-1]){ //比当前的数大的话插在后面 pos++; }else{ //如果小的话在前面找到合适的位置插入 int m = search(0,pos-1,arr[pos]); arr[m+1]=arr[pos]; } } printf("%d\n",pos); } return 0; }
相关文章推荐
- poj 1631 Bridging signals (LIS 最长递增子序列 DP-二分)
- POJ 1631 Bridging signals DP(最长上升子序列)
- POJ1631最长单调递增子序列
- POJ--1887:Testing the CATCHER (DP求最长非递增子序列)
- POJ 1836 DP(最长递增子序列)
- POJ 1631-Bridging signals(最长上升子序列+二分搜索)
- poj1631 dp 最长上升子序列LIS
- [dp]最长递增子序列poj 1631Bridging signals
- POJ 2533 - Longest Ordered Subsequence(dp 最长递增子序列)
- POJ 1631 Bridging signals 解题报告(附详细分析)最长上升子序列的dp+二分
- poj 1631 Bridging signals(最长递增子序列)
- hdu 1025 dp+二分求最长递增子序列
- poj 2127 dp(最长公共递增子序列)
- UVALive5170 UVA231 POJ1887 Testing the CATCHER【最长下降子序列+DP+二分搜索】
- 动态规划(线性模型):POJ 1631 最长上升子序列
- HDU Monkey and Banana 1069 dp 动态规划 最长递增子序列
- POJ-1836 Alignment (Romania OI 2002 线性dp 最长上升子序列)
- (复习)poj 1952 最长下降子序列—— dp+方案个数
- (二分+dp) poj 1631 Bridging signals
- POJ-1887 Testing the CATCHER(dp,最长下降子序列)