【dp:LIS】hdu1025
来源:互联网 发布:java数组为空和为null 编辑:程序博客网 时间:2024/05/22 06:43
Constructing Roads In JGShining's Kingdom
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16266 Accepted Submission(s): 4634
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.经典水题,LIS,但是要注意以下输出roads 和road ..//果然LIS 。。 #include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;#define maxn 555555int a[maxn],b[maxn];int dp[maxn];//dp[i]表示长度为i的子序列的末尾最小值 struct Node{int a,b; }c[maxn];bool cmp(Node x,Node y){return x.a<y.a;}int bin(int x,int len){int l=0,r=len,m;while(l<=r){m=(l+r)>>1;if(x>dp[m])l=m+1;else r=m-1;}return l;}int main(){int n,cas=1;int i,j;//freopen("q.in","r",stdin);while(~scanf("%d",&n)){for(i=0;i<n;i++)scanf("%d%d",&c[i].a,&c[i].b);sort(c,c+n,cmp);fill(dp,dp+n+1,maxn); dp[0]=0;int len=1;dp[1]=c[0].b;for(i=1;i<n;i++){if(c[i].b>dp[len]){dp[++len]=c[i].b;}else {int pos=bin(c[i].b,len);dp[pos]=c[i].b;}}cout<<"Case "<<cas++<<":"<<endl;cout<<"My king, at most "<<len;if(len>1)cout<<" roads can be built."<<endl;else cout<<" road can be built."<<endl;cout<<endl;}}
0 0
- 【dp:LIS】hdu1025
- hdu1025 LIS
- hdu1025 - LIS
- hdu1025 LIS
- HDU1025:Constructing Roads In JGShining's Kingdom(LIS(dp+二分))
- HDU1025 nlogn的LIS
- hdu1025
- HDU1025
- hdu1025
- hdu1025
- hdu1025
- HDU1025
- LIS DP
- HDU1025:Constructing Roads In JGShining's Kingdom(LIS)
- hdu1025 Constructing Roads In JGShining's Kingdom (nlogn的LIS)
- HDU1025 Constructing Roads In JGShining's Kingdom (LIS)
- HDU 4001 DP LIS
- poj2533 简单DP LIS
- hdu 4864 任务分配贪心
- HDOJ题目2608 0 or 1(数学)
- selenium+java+testNG+pageObject深入理解自动化测试框架
- 重写 - init 方法总结
- 第一篇博文
- 【dp:LIS】hdu1025
- listview每一条中间有空隙问题解决
- Struts2的工作流程及原理
- printf(&unix["\021%six\012\0"], (unix)["have"] + "fun" - 0x60);
- 数组变集合 练习笔记
- 关于计算机中小端法和大端法存储的一点总结
- 【boost学习】之boost::bind
- 实现在mysql数据库中保存text大文本和blob大二进制数据
- UVA - 193 Graph Coloring