hdoj 1025 Constructing Roads In JGShining's Kingdom 【最长递增子序列】
来源:互联网 发布:梦幻西游淘宝网 编辑:程序博客网 时间:2024/06/05 15:44
Constructing Roads In JGShining's Kingdom
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 16262 Accepted Submission(s): 4633
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.
分析:传统的o(n2)的肯定会超时,所以用一种O(nlgn)的算法。主要是用了二分查找。。
关于这种算法http://www.cnblogs.com/dongsheng/archive/2013/01/25/2876323.html这个讲的很好。
代码:
#include <stdio.h>#include <string.h>#include <algorithm>#define M 500005using namespace std;struct node{ int p, r;}s[M];int d[M];int cmp(node a, node b){ return a.p<b.p;}int bis(int s, int len){ int right = len, left = 0, mid; while(left <= right){ mid = (left+right)>>1; if(d[mid]>s) right = mid-1; else if(d[mid] < s) left = mid+1; else return mid; } return left;}int main(){ int n, v=1; while(scanf("%d", &n) == 1){ memset(d, 0, sizeof(d)); int i, len; for(i = 0; i < n; i ++) scanf("%d%d", &s[i].p, &s[i].r); sort(s, s+n, cmp); len = 1; d[len] = s[0].r; for(i = 1; i < n; i ++){ int t = bis(s[i].r, len); d[t] = s[i].r; if(t > len) len++; } printf("Case %d:\n", v++); printf("My king, at most %d road", len); if(len > 1) printf("s"); printf(" can be built.\n\n"); } return 0;}
0 0
- hdoj 1025 Constructing Roads In JGShining's Kingdom 【最长递增子序列】
- HDOJ题目1025 Constructing Roads In JGShining's Kingdom(动态规划,最长递增子序列二分)
- [ACM] hdu 1025 Constructing Roads In JGShining's Kingdom (最长递增子序列,lower_bound使用)
- HDU 1025 Constructing Roads In JGShining's Kingdom (LIS 最长递增子序列)
- HDU 1025 Constructing Roads In JGShining's Kingdom(最长递增子序列)
- HDOJ 1025 Constructing Roads In JGShining's Kingdom(最长上升子序列)
- Constructing Roads In JGShining's Kingdom最长递增序列+二分
- Constructing Roads In JGShining's Kingdom(最长上升子序列)
- HDU1025 Constructing Roads In JGShining's Kingdom(最长递增子序列)
- Constructing Roads In JGShining's Kingdom(最长单调递增子序列应用+hdu1025)
- hdu1025 Constructing Roads In JGShining's Kingdom(最长递增公共子序列二分法)
- hdoj1025 Constructing Roads In JGShining's Kingdom (最长递增子序列 , map)
- 暑期dp46道(16)hdoj 1025 Constructing Roads In JGShining's Kingdom最长上升子序列(二分)
- hdu 1025 Constructing Roads In JGShining's Kingdom【即求最长上升子序列】
- HDU 1025 Constructing Roads In JGShining's Kingdom(最长上升子序列+n*logn算法)
- hdu 1025 Constructing Roads In JGShining's Kingdom(树状数组求最长上升子序列)
- hdu 1025 Constructing Roads In JGShining's Kingdom (最长上升子序列)
- hdu 1025 Constructing Roads In JGShining's Kingdom 最长上升子序列(nlogn)
- 比(My)Eclipse更好的选择:ItelliJ IDEA
- 用php做消息推送
- C_二维数组, 字符串数组, 及多维数组
- 判断要导入课程是否存在
- TestNG的组测试和组中组测试
- hdoj 1025 Constructing Roads In JGShining's Kingdom 【最长递增子序列】
- 缓冲运动[实例--上下滑动客服
- 新型营销模式CP2C
- 软件方法笔记-4业务序列
- Ambari-整体介绍
- 大连海鲜美食素材提供者~大连海缘新品上市~~~大海虾
- 跟我一起学extjs5(41--增加一个自定义模块(源码下载)[2销售合同加入菜单和模块展示])
- 神兵利器——Alfred
- 自己动手编译hsdis