Constructing Roads In JGShining‘s Kingdom
Problem Description
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. ^_^
Input
Each test case will begin with a line containing an integer n(1 ≤ n ≤ 500,000). Then n lines follow. Each line contains two integers p and r which represents that Poor City p needs to import resources from Rich City r. Process to the end of file.
Output
For each test case, output the result in the form of sample.
You should tell JGShining what‘s the maximal number of road(s) can be built.
Sample Input
2
1 2
2 1
3
1 2
2 3
3 1
Sample Output
Case 1:
My king, at most 1 road can be built.
Case 2: My king, at most 2 roads can be built.
２条平行线，每一边都有ｎ个城市，现在要建n条公路，起点和终点分别在两边
给出这n条公路的起点和终点
现在要求每条公路都不能交叉，问，这n条公路最多能建几条
对起点小到大排序，对终点，就是求他的LIS了
用以前那种DP的话，由于n<=500000, 是n^2,tle 了
2分求出LIS的长度
有个很坑的地方。
1 #include<cstdio>
2 #include<algorithm>
3 #include<cstring>
4
5 using namespace std;
6
7 const int maxn=500000+5;
8
9 struct Node
10 {
11 int a,b;
12 }node[maxn];
13
14 int dp[maxn];
15
16 bool cmp(Node x,Node y)
17 {
18 if(x.a==y.a)
19 return x.b<y.b;
20 return x.a<y.a;
21 }
22
23 int Search(int num,int low,int high)
24 {
25 int mid;
26
27 while(low<=high)
28 {
29 mid=(low+high)/2;
30
31 if(num>=dp[mid])
32 low=mid+1;
33 else
34 high=mid-1;
35 }
36
37 return low;
38 }
39
40 int DP(int n)
41 {
42 int len=1;
43
44 dp[len]=node[1].b;
45
46 for(int i=2;i<=n;i++)
47 {
48 if(node[i].b>dp[len])
49 {
50 len++;
51 dp[len]=node[i].b;
52 }
53 else
54 {
55 int pos=Search(node[i].b,1,len);
56
57 dp[pos]=node[i].b;
58 }
59 }
60 return len;
61 }
62
63 int main()
64 {
65 int n;
66
67 int cas=1;
68
69 while(scanf("%d",&n)!=EOF)
70 {
71 for(int i=1;i<=n;i++)
72 scanf("%d%d",&node[i].a,&node[i].b);
73
74 sort(node+1,node+n+1,cmp);
75
76 int len=DP(n);
77
78 printf("Case %d:\n",cas++);
79
80
81
82 //超级坑，len<=1的时候是road
83 //len>1的时候road为复数，是roads
84
85
86
87 if(len<=1)
88 printf("My king, at most %d road can be built.\n\n",len);
89 else
90 printf("My king, at most %d roads can be built.\n\n",len);
91
92 }
93 return 0;
94 }
HDU 1025 Constructing Roads In JGShining's Kingdom LIS 简单题 好题 超级坑