hdoj1025Constructing Roads In JGShining's Kingdom【LIS】
来源:互联网 发布:网络摄像头哪个牌子好 编辑:程序博客网 时间:2024/06/05 07:23
Constructing Roads In JGShining's Kingdom
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21495 Accepted Submission(s): 6087
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. ^_^
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.
You should tell JGShining what's the maximal number of road(s) can be built.
Sample Input
21 22 131 22 33 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.HintHuge input, scanf is recommended.
Author
JGShining(极光炫影)
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<list>#include<vector>using namespace std;const int maxn=500010;int lb[maxn],la[maxn];int lis(int n){ int i,j,len=1;lb[1]=la[1]; for(i=2;i<=n;++i){ int left=1,right=len,flag=0; if(la[i]>lb[len]){ len++;lb[len]=la[i]; continue; } while(left<=right){ int mid=(left+right)>>1; if(la[i]>lb[mid]){ left=mid+1; } else { right=mid-1; } } lb[left]=la[i]; } return len; } int main(){ int t,i,j,k,n,p,r,test=1; while(scanf("%d",&n)!=EOF){ for(i=1;i<=n;++i){ scanf("%d%d",&p,&r); la[p]=r; } printf("Case %d:\n",test++); int ans=lis(n); if(ans==1) printf("My king, at most %d road can be built.\n\n",ans); else printf("My king, at most %d roads can be built.\n\n",ans); } return 0;}
0 0
- hdoj1025Constructing Roads In JGShining's Kingdom【LIS】
- hdoj1025Constructing Roads In JGShining's Kingdom(LIS)
- hdu 1025Constructing Roads In JGShining's Kingdom(LIS)
- hdu 1025 Constructing Roads In JGShining's Kingdom(LIS)
- HDU1025:Constructing Roads In JGShining's Kingdom(LIS)
- hdu 1025 Constructing Roads In JGShining's Kingdom (LIS)
- hdu1025 Constructing Roads In JGShining's Kingdom (nlogn的LIS)
- hdu 1025 Constructing Roads In JGShining's Kingdom (LIS)
- HDU1025:Constructing Roads In JGShining's Kingdom(LIS(dp+二分))
- HDU 1025 Constructing Roads In JGShining's Kingdom LIS题解
- 【DP|LIS】HDU-1025 Constructing Roads In JGShining's Kingdom
- HDU1025_Constructing Roads In JGShining's Kingdom【LIS】【二分法】
- 1205 Constructing Roads In JGShining's Kingdom【lis】
- HDU 1025 Constructing Roads In JGShining's Kingdom(LIS)
- hdoj 1025 Constructing Roads In JGShining's Kingdom 【LIS】
- hdu 1025 Constructing Roads In JGShining's Kingdom(lis)
- HDU Problem 1025 Constructing Roads In JGShining's Kingdom 【LIS】
- 【HD 1025】Constructing Roads In JGShining's Kingdom(LIS)
- hdu1698 Just a Hook(成段更新+懒惰标记)
- fnmatch模块的使用
- 最大映射
- poj 3608(旋转卡壳求解两凸包之间的最短距离)
- 字典树
- hdoj1025Constructing Roads In JGShining's Kingdom【LIS】
- 我的第一个嵌入式linux驱动(基于韦东山led驱动)
- [linux]查看端口号占用情况
- IOS学习 绘图 UIBezierPath 绘基本图形、样式设置、渲染填充
- 运算器的特殊实现方法
- hdoj1078FatMouse and Cheess【记忆化搜索】
- 深度优先搜索DFS
- Hamx安装失败的问题
- C++虚函数