HDU 1950(LIS)
来源:互联网 发布:阿里云yum安装mysql 编辑:程序博客网 时间:2024/05/19 17:10
problem
‘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
思路
题面比较长,看样例就是要求LIS。由于数据量五位数,要用优化后的DP方法。我觉得有最优化(贪心)的思想,找10个数将过程模拟一遍有助于理解。
代码示例
#include<bits/stdc++.h>using namespace std;int dp[40005];int main(){ ios::sync_with_stdio(false); int n,t; cin>>t; while(t--) { cin>>n; dp[0]=0; int tail=0; int a; for(int i=1;i<=n;++i){ cin>>a; //二分 int low=0,high=tail-1; while(low<=high){ int mid=(low+high)/2; if(dp[mid]>=a) high=mid-1; else low=mid+1; } //也可用 int low=lower_bound(dp,dp+tail,a)-dp; 代替 //新加入的数能够使得可得到的最长子序列长度增加,而不是替换之前的值 if(low>=tail) tail++; dp[low]=a; } cout<<tail<<endl; } return 0;}
- HDU 1950(LIS)
- HDU 1950 Bridging signals (LIS)
- HDU 1950 - Bridging signals(LIS)
- Poj 1631 && Hdu 1950 Bridging signals【LIS】
- hdu 1950 Bridging signals【LIS nlogn】
- HDU 1950 Bridging signals(LIS)
- HDU 1950 Bridging signals(LIS)
- hdu 1950 Bridging signals (lis)
- HDU Problem 1950 Bridging signals 【LIS】
- 【HDU】-1950-Bridging signals(LIS,模板)
- HDU 1950 Bridging signals(LIS nlogn)
- LIS 两种算法分析+hdu 1950
- HDU-1950 Bridging signals (nlogn求LIS)
- HDU 4001 DP LIS
- hdu 1677 (LIS+贪心)
- hdu 3564 Another Lis
- HDU 4604 lower_bound,LIS
- HDU 1677 LIS
- 设计模式_抽象工厂模式(4)
- 结构体中运算符的重载
- setuptools 和easy_install介绍和安装方法
- Leetcode-117: Populating Next Right Pointers in Each Node II
- LuoguP1637 三元上升子序列
- HDU 1950(LIS)
- syntax error: non-declaration statement outside function body
- 关于Java中的 i = i ++ 的问题
- 聊天室
- [编程题] 头条校招
- HDU4358【离散化+DFS序+莫队算法】
- AI开发实战3-定制自己的Screen
- leetcode[Longest Harmonious Subsequence]
- 面向对象编程思想-观察者模式