HDOJ 1950 Bridging signals(LIS)

原创 2015年11月20日 21:45:53


Bridging signals

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


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
 

说一大推,就是让求最长上升子序列,完全裸题。STL大法好用啊,O(nlogn)算法时间短,代码短。

代码如下:

#include<cstdio>
#include<algorithm>
#define INF 0x3f3f3f
using namespace std;
int a[40010],dp[40010];
int main()
{
	int n,i,t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(i=0;i<n;++i)
		{
			scanf("%d",&a[i]);
			dp[i]=INF;
		}
		for(i=0;i<n;++i)
			*lower_bound(dp,dp+n,a[i])=a[i];
		printf("%d\n",lower_bound(dp,dp+n,INF)-dp);
	}
	return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。如有错误,欢迎指出~(@^_^@)~

hdoj 1950 Bridging signals 【DP经典问题LIS 的 经典算法】

Bridging signals Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...
  • chenzhenyu123456
  • chenzhenyu123456
  • 2015年07月30日 18:46
  • 659

hdoj1950Bridging signals(最长上升子序列)

Bridging signals Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...
  • zhangxiaoxiang123
  • zhangxiaoxiang123
  • 2015年08月15日 20:04
  • 531

hdoj 1950 Bridging signals (LIS+二分)

Bridging signals Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...
  • bmicnj
  • bmicnj
  • 2016年08月11日 18:15
  • 140

HDOJ 1541 Stars(线段树单点更新)

Stars Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Su...
  • helloiamclh
  • helloiamclh
  • 2015年10月21日 14:13
  • 299

HDU1950-Bridging signals(最长上升子序列)

Bridging signals Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...
  • a664607530
  • a664607530
  • 2016年06月05日 19:49
  • 267

HDOJ 1950 Bridging signals

Bridging signals Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...
  • qq_28175337
  • qq_28175337
  • 2015年07月30日 10:48
  • 138

HDOJ 1950 Bridging signals

Bridging signals Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...
  • A_ice_
  • A_ice_
  • 2016年08月11日 20:04
  • 104

hdu 1950

最长上升子序列(LIS)的典型变形,熟悉的n^2的动归会超时。LIS问题可以优化为nlogn的算法。 定义d[k]:长度为k的上升子序列的最末元素,若有多个长度为k的上升子序列,则记录最小的那个最末...
  • chaoyueziji123
  • chaoyueziji123
  • 2014年07月21日 19:53
  • 610

HDU_1950 Bridging Signals(DP)

Bridging signals Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...
  • EaShion1994
  • EaShion1994
  • 2015年01月28日 22:18
  • 472

HDOJ 1950 Bridging signals(LIS nlogn)

Bridging signals Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...
  • helloiamclh
  • helloiamclh
  • 2015年10月22日 21:24
  • 200
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDOJ 1950 Bridging signals(LIS)
举报原因:
原因补充:

(最多只允许输入30个字)