关闭

POJ 1631 Bridging signals(最长上升子序列 nlgn做法)

标签: ACMPOJDP最长上升子序列LIS
191人阅读 评论(0) 收藏 举报
分类:

传送门:http://poj.org/problem?id=1631
Bridging signals
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 12687   Accepted: 6915

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

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


解题思路:因为题目中要求在平面上的桥不交叉,所以可以转化为最长上升子序列问题。又因为数据量比较大,所以只能采用O(nlgn)的算法。

AC code:

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

const int N = 41000;
int a[N];       //a[i] 原始数据
int d[N];       //d[i] 长度为i的递增子序列的最小值

int BinSearch(int key, int low, int high)//二分查找
{
    while(low<=high)
    {
        int mid = (low+high)>>1;
        if(key>d[mid] && key<=d[mid+1])
            return mid;
        else if(key>d[mid])
            low = mid+1;
        else
            high = mid-1;
    }
    return 0;
}

int LIS( int n )//n->数列的长度
{
    int i,j;
    d[1] = a[1];
    int len = 1;        //递增子序列长度
    for(i = 2; i <= n; i++)
    {
        if(d[len]<a[i])
            j = ++len;
        else
            j = BinSearch(a[i],1,len) + 1;
        d[j] = a[i];
    }
    return len;
}

int main()
{
    //freopen("test.txt","r",stdin);
    int t,n,i;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=1;i<=n;i++)
            scanf("%d",&a[i]);
        printf("%d\n",LIS(n));
    }
    //cout << "Hello world!" << endl;
    return 0;
}

0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

POJ-1631-Bridging signals

这个题就是求最长上升子序列 代码: #include #include #include #include using namespace std; const int maxn=40010; const int inf=1<<28; int n,a[maxn],g[maxn]; i...
  • z309241990
  • z309241990
  • 2013-07-08 00:37
  • 382

Bridging signals

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1079   &#...
  • l15738519366
  • l15738519366
  • 2015-07-30 21:47
  • 634

POJ 1631 Bridging signals(LIS 二分 快速方法)

Language: Default Bridging signals Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 10762   ...
  • u014737310
  • u014737310
  • 2014-10-19 15:40
  • 1214

POJ - 1631 Bridging signals

最长上升子序列LIS解法
  • sinat_29278271
  • sinat_29278271
  • 2016-04-18 23:13
  • 186

HDU1950 Bridging signals 裸LIS

Bridging signalsBridging signals 题意 代码题意HDU1950 裸LIS,信号不能交叉,编号1-N,实际上就是有序上升,趁5773复习了LIS,直接交了一发,基本没改。代码#include <cstdio> #define MAX 100000 #de...
  • iSerendipity
  • iSerendipity
  • 2016-07-29 16:41
  • 311

POJ 1631 Bridging signals(最长上升子序列 n*logn && POJ 3903)

Bridging signals Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 11025   Accepted: 6043 Descripti...
  • u014361775
  • u014361775
  • 2015-01-19 20:43
  • 426

Bridging signals

Bridging signals Time Limit : 5000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 68 &...
  • yanghui07216
  • yanghui07216
  • 2015-07-31 00:00
  • 152

POJ-1631-Bridging signals-( 水LIS-O(nlogn) -DP)

题目大意:求最长上升子序列(LIS)长度,序列最大数不超过40000。因为只有上升排列的接口才不相交。 思路:普通的 O(n^2)的做法肯定会超时;因此,dp[ ] 记录长度为 i+1 的子序列中最末元素的最小值,这一数组是单调递增的,因此对于dp[ ]数组内元素可以用二分搜索找出dp[ ]中比 a...
  • u011652573
  • u011652573
  • 2014-03-06 14:58
  • 780

Sicily 1060. Bridging Signals

这题挺简单。 看图就懂意思了,求不相交的线数目。 什么时候两条线交叉呢?   ---  i > j  但 a[i] 由于题目中a[i] = i ; 那就简单地成为了一个经典 ” 最长上升子序列 “问题啦。 数据到了w的级别,用 O(nlgn)的贪心方法...
  • linhan8
  • linhan8
  • 2013-10-01 18:32
  • 676

POJ1631——Bridging signals(动态规划)

题目链接        真的很想说这道题读懂题意比解决题目本身要难。。。然而题目本身的意思又很简单就是求最长递增子序列。但这道题有点特殊的地方就是要优化,常规的两个for的方法会超时,然后在《挑战程序设计竞赛》这本书上给了另一个nlo...
  • Jason_crawford
  • Jason_crawford
  • 2017-01-15 19:38
  • 200
    个人资料
    • 访问:39514次
    • 积分:1897
    • 等级:
    • 排名:千里之外
    • 原创:154篇
    • 转载:0篇
    • 译文:0篇
    • 评论:5条
    文章分类
    最新评论