zoukankan      html  css  js  c++  java
  • poj 1631 Bridging signals (二分||DP||最长递增子序列)

    Bridging signals
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 9234   Accepted: 5037

    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
    思路:
    最长递增子序列:

    (二分)代码:
     1 #include<iostream>
     2 #include<stdio.h>
     3 int arr[40010];
     4 
     5 int search(int a,int b,int n){  //二分
     6     int mid;
     7     while(a<=b){
     8         mid = (a+b)/2;
     9         if(n>arr[mid]){
    10             a = mid + 1;
    11         }else{
    12             b = mid - 1;
    13         }
    14     }
    15     return b;
    16 }
    17 
    18 int main(){
    19     int t;
    20     scanf("%d",&t);
    21     while(t--){
    22         int n,i;
    23         scanf("%d",&n);
    24         scanf("%d",&arr[0]);
    25         int pos=1;
    26         for(i=1;i<n;i++){
    27             scanf("%d",&arr[pos]);
    28             if(arr[pos]>=arr[pos-1]){  //比当前的数大的话插在后面
    29                 pos++;
    30             }else{   //如果小的话在前面找到合适的位置插入
    31                 int m = search(0,pos-1,arr[pos]);
    32                 arr[m+1]=arr[pos];
    33             }
    34         }
    35         printf("%d
    ",pos);
    36     }
    37     return 0;
    38 }
  • 相关阅读:
    Python环境变量的配置
    关于selenium+python的googledirver和iedirver的配置
    jdk1.6环境变量配置
    windows server 2012R2安装激活码
    Git生成SSHKey
    Linux下配置和安装VNCServer远程服务
    Win7 64位硬盘安装Ubuntu 64位的细微配置
    apache tomcat 8.0 显示目录文件
    跨域登录
    jsonp 代码优化
  • 原文地址:https://www.cnblogs.com/crazyapple/p/3195545.html
Copyright © 2011-2022 走看看