HDU 1025 Constructing Roads In JGShining's Kingdom

JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines. Half of these cities are rich in resource (we call them rich cities) while the others are short of resource (we call them poor cities). Each poor city is short of exactly one kind of resource and also each rich city is rich in exactly one kind of resource. You may assume no two poor cities are short of one same kind of resource and no two rich cities are rich in one same kind of resource. With the development of industry, poor cities wanna import resource from rich ones. The roads existed are so small that they're unable to ensure the heavy trucks, so new roads should be built. The poor cities strongly BS each other, so are the rich ones. Poor cities don't wanna build a road with other poor ones, and rich ones also can't abide sharing an end of road with other rich ones. Because of economic benefit, any rich city will be willing to export resource to any poor one. Rich citis marked from 1 to n are located in Line I and poor ones marked from 1 to n are located in Line II. The location of Rich City 1 is on the left of all other cities, Rich City 2 is on the left of all other cities excluding Rich City 1, Rich City 3 is on the right of Rich City 1 and Rich City 2 but on the left of all other cities ... And so as the poor ones. But as you know, two crossed roads may cause a lot of traffic accident so JGShining has established a law to forbid constructing crossed roads. For example, the roads in Figure I are forbidden.   In order to build as many roads as possible, the young and handsome king of the kingdom - JGShining needs your help, please help him. ^_^

 

大概就是说给定一个两两配对序列，求在连线不交叉的情况下，有多少对城市能够配对。因为连线不交叉，所以每个点对应的城市标号必定是单调递增的，那么问题就转换成了LIS问题。又因为数据范围是50w，所以不能用n^2的写法，我用了STL的lower_bound函数写的。注意答案为1的时候是英文的单数(雾。

 

 

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 5e5;
const int INF = 0x7fffffff;
int dp[maxn + 5], arr[maxn + 5], n, x, y, res, cas;
int main(void)
{
	while (~scanf("%d", &n)) {
		memset(dp, 0, sizeof(dp));
		for (int i = 1; i <= n; ++i) {
			scanf("%d %d", &x, &y);
			arr[x] = y;
		}
		res = 1; dp[1] = arr[1];
		for (int i = 2; i <= n; i++) {
			if (arr[i] > dp[res])dp[++res] = arr[i];
			if (arr[i] < dp[res]) {
				int k = lower_bound(dp, dp + res, arr[i]) - dp;
				dp[k] = arr[i];
			}
		}
		printf("Case %d:\n", ++cas);
		if (res == 1)printf("My king, at most 1 road can be built.\n");
		else printf("My king, at most %d roads can be built.\n", res);
		printf("\n");
	}
	return 0;
}