【HDU 1950】 Bridging signals (最长上升子序列nlogn算法)(二分,动态规划)
来源:互联网 发布:淘宝商家怎么交保证金 编辑:程序博客网 时间:2024/05/24 22:46
Bridging signals
Time Limit: 5000/1000 MS (Java/Others)Total Submission(s): 210
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.
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
//由于数据过大,用常用的动态规划会超时,所以考虑用二分将其优化。
#include<cstdio>
using namespace std;
#define MAXN 40002
int a[MAXN],d[MAXN];
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
int len=1;
d[1] = a[1];
for(int i=2;i<=n;i++)
{
if(d[len]<a[i])
{
d[++len] = a[i];
}
int l=1,r=len,mid;
while(l<=r)
{
mid = (l+r)/2;
if(d[mid]<a[i])
l = mid+1;
else
r = mid-1;
}
d[l] = a[i];
}
printf("%d\n",len);
}
return 0;
}
#include<cstdio>
using namespace std;
#define MAXN 40002
int a[MAXN],d[MAXN];
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
int len=1;
d[1] = a[1];
for(int i=2;i<=n;i++)
{
if(d[len]<a[i])
{
d[++len] = a[i];
}
int l=1,r=len,mid;
while(l<=r)
{
mid = (l+r)/2;
if(d[mid]<a[i])
l = mid+1;
else
r = mid-1;
}
d[l] = a[i];
}
printf("%d\n",len);
}
return 0;
}
阅读全文
0 0
- 【HDU 1950】 Bridging signals (最长上升子序列nlogn算法)(二分,动态规划)
- 动态规划:最长上升子序列(二分算法 nlogn)
- 【HDU1950】Bridging signals (最长上升子序列DP(nlogn))
- HDU-1950-Bridging signals【最长上升子序列(LIS)长度的O(nlogn)算法】
- HDU 1950 Bridging signals (最长递增子序列(nlogn算法)
- 【HDU 1950】Bridging signals(LIS算法求最长上升子序列)
- hdu 1950 Bridging signals 最长上升序列nlogn
- Bridging signals 最长上升序列+动态规划+二分
- POJ1631——Bridging signals(动态规划,最长上升子序列应用)
- HDU-1905-Bridging signals(二分求最长上升子序列)
- HDU 1950(Bridging signals)最长不降子序列nlogn
- 杭电1950 Bridging signals(二分求最长上升子序列)
- hdu 1950 Bridging signals--二分法求最长上升子序列
- hdu 1950 Bridging signals 最长上升子序列
- HDU 1950 Bridging signals 最长公共子序列(LIS)nlogn算法实现
- 最长上升子序列(LIS)POJ 1631 Bridging Signals
- HDU1950-Bridging signals(最长上升子序列)
- POJ 1631-Bridging signals(最长上升子序列+二分搜索)
- Python 里面的一些小技巧(持续更新)
- java web基础大总结
- 最长上升子数列
- 基于XILINX FPGA的卷积神经网络(三)
- PAT L2-022 重排链表 (deque双向队列)
- 【HDU 1950】 Bridging signals (最长上升子序列nlogn算法)(二分,动态规划)
- 【CUGBACM15级BC第16场 A】Revenge of Segment Tree
- awk详解(1)
- 最简单的python 爬虫
- myeclipse 导入 play项目
- 递归问题学习三之生成指定字符串的全排序
- 【NOIP2017】Day7
- Centos 7安装 pgplot
- 数据结构与算法之动态规划