POJ1631 Bridging signals 最长上升子序列

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

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 specifies 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.

        这题大意就是一个电路板上有N对端口，如果所示。现在需要将左边的端口和右边的端口一一连接起来，但是出现了交叉情况，所以需要在交叉的连接中选择某些连接进行“搭桥”，这样就会避免直接交叉。现给定这些连接关系，求最少的搭桥数。

        这题意思就是选择尽可能多的互不交叉的进行连接，然后将剩下的搭桥，假设左边的端口分别对应右边的端口序列为

a1,a2,a3...aN，然后就找到最长的子序列 ai < aj <am...，也就是求最长上升子序列（LIS）。

#ifndef HEAD
#include <stdio.h>
#include <vector>
#include <math.h>
#include <string.h>
#include <string>
#include <iostream>
#include <queue>
#include <list>
#include <algorithm>
#include <stack>
#include <map>

using namespace std;
#endif // !HEAD

#ifndef QUADMEMSET
inline void QuadMemSet(void* dst, int iSize, int value)
{
	iSize = iSize / 4;
	int* newDst = (int*)dst;
#ifdef WIN32
	__asm
	{
		mov edi, dst
			mov ecx, iSize
			mov eax, value
			rep stosd
	}
#else
	for (int i = 0; i < iSize; i++)
	{
		newDst[i] = value;

	}
#endif
}
#endif

int dp[40002];
int dvalue[40002];
#define INF	50000


int main()
{
#ifdef _DEBUG
	freopen("d:\\in.txt", "r", stdin);
#endif
	int n;
	scanf("%d\n", &n);
	for (int i = 0; i < n;i++)
	{
		int p;
		scanf("%d\n", &p);
		memset(dvalue, 0, sizeof(dvalue));
		QuadMemSet(dp, sizeof(dp), INF);
		for (int j = 0; j < p;j++)
		{
			scanf("%d\n", &dvalue[j]);
		}
		for (int j = 0; j < p;j++)
		{
			*lower_bound(dp, dp + p, dvalue[j]) = dvalue[j];
		}
		printf("%d\n", lower_bound(dp, dp + p, INF) - dp);
	}

	return 0;
}