最长上升子序列
2017-07-14 10:55
295 查看
Bridging signals
Time Limit : 5000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 15 Accepted Submission(s) : 7Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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 tooexpensive 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 callfor 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 problemasks 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 numbersin 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. Thenfollow 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 <string.h>#include <algorithm>#include <stdio.h>#include <queue>#include <cmath>#include <stdlib.h>using namespace std;int dp[40005];int a[40005],b[40005];int len;int lb(int x){ int left=0,right=len; while(left<right) { int mid=left+(right-left)/2; if(b[mid]>=a[x])right=mid; else left=mid+1; } return left;}int main(){ int T; cin>>T; while(T--) { int n; cin>>n; int i; for(i=1;i<=n;i++) cin>>a[i]; b[1]=a[1]; len=1; for(i=2;i<=n;i++) { if(a[i]>b[len]) { len++; b[len]=a[i]; } else { int z=lb(i); b[z]=a[i]; } } cout<<len<<endl; } return 0;}
相关文章推荐
- CodeForces 650D Zip-line(最长上升子序列)
- 最长不上升子序列
- uva10534 - Wavio Sequence O(nlgn)的最长上升子序列
- hdu6197 最长上升子序列(LIS)长度
- HDU-4521 小明系列问题——小明序列 间隔限制最长上升子序列
- n*log(n)的最长上升子序列
- LIS最长上升子序列O(n^2)&O(nlogn)
- 最长上升子序列(Longest Increasing Subsequence)
- 最长上升子序列的两种方法
- HDU 1257(贪心;动态规划(最长上升子序列))
- [Treap] [LIS] BZOJ[3173] [Tjoi2013]最长上升子序列
- 最长上升子序列模板
- poj 2127(最长公共上升子序列)
- 最长公共上升子序列(LIS)
- POJ 1631 最长上升子序列O(nlogn)
- 最长上升子序列
- 动态规划_最长上升子序列LIS
- poj 1836 (动态规划之最长上升子序列)
- HDU1423&ZOJ2432 - Greatest Common Increasing Subsequence(LCIS最长公共上升子序列模板)
- hdu 1423(最长公共上升子序列)