zoukankan      html  css  js  c++  java
  • 杭电1950--Bridging signals (二分法→ →LIS)

    Bridging signals

    Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 971    Accepted Submission(s): 634


    Problem 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 rossing each other, is imminent. Bearing in mind that there may be housands 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?

    Figure 1. To the left: The two blocks' ports and their signal mapping (4,2,6,3,1,5). To the right: At most three signals may be routed on the silicon surface without crossing each other. The dashed signals must be bridged.

    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 pecifies 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
     

     

    Source
     

     

    Recommend
    wangye   |   We have carefully selected several similar problems for you:  1864 1231 1978 1501 1422 
     
     
    //函数lower_bound()在first和last中的前闭后开区间进行二分查找,返回大于或等于val的第一个元素位置。如果所有元素都小于val,则返回last的位置(可以越界);**返回值是地址**
    num = {10, 3, 2, 50}  
                  插入1→ →lower_bound(num, num+3, 1) = 0   ;
                  插入60→ →lower_bound(num, num+3, 60) = 4;
    思路: 找最长递增子序列。
     1 #include <stdio.h>
     2 #include <algorithm>
     3 using namespace std;
     4 int num[40040];
     5 int main()
     6 {
     7     int i, n, p;
     8     scanf("%d", &n);
     9     while(n--)
    10     {
    11         scanf("%d", &p);
    12         scanf("%d", &num[0]);
    13         int m , top = 1;
    14         for(i=1; i<p; i++)
    15         {
    16             scanf("%d", &m);
    17             if(num[top-1] < m)
    18             num[top++] = m;
    19             else
    20             {
    21                 int posi=lower_bound(num, num+top-1, m) - num;   ***~。~***
    22                 num[posi]=m; 
    23             }
    24         }
    25         printf("%d
    ",top);
    26         
    27     } 
    28     return 0; 
    29 } 
  • 相关阅读:
    beanstalkd 安装和配置
    vm虚拟机用批处理启动和关闭
    Windows设置VMware开机自动启动,虚拟机也启动
    批处理脚本学习笔记1--vmware虚拟机启停控制
    Shell中uname命令查看系统内核、版本
    SHELL脚本里执行的东西需要多次回车确认,怎么实现自动回车确认?
    eclipse下搭建shell脚本编辑器--安装开发shell的eclipse插件shelled
    如何进行shell脚本正确性测试
    robot framework
    loadrunner参数化数据分配方法
  • 原文地址:https://www.cnblogs.com/soTired/p/4688934.html
Copyright © 2011-2022 走看看