hdu-1025 Constructing Roads In JGShining's Kingdom(二分查找)
题目链接:
Constructing Roads In JGShining's Kingdom
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21045 Accepted Submission(s): 5950
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. ^_^
You should tell JGShining what's the maximal number of road(s) can be built.
Huge input, scanf is recommended.
题意:给你两个条线上一对一对的点,要把这一对一对的点连接起来,且连线不能相交,问最多有多少条线;
思路:按其中的一组数的大小排序,然后另一列数的最长上升子序列的长度就是答案,然后用一个O(n*logn)的算法找到这个长度,O(n^2)的方法会超时;
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <algorithm>
using namespace std;
const int N=5e5+;
int ans[N];
struct node
{
int a,b;
};
node x[N];
int cmp(node c,node d)
{
// if(c.a==d.a)return c.b<d.b;
return c.a<d.a;
}
stack<int>s;
int main()
{
int n;
int cnt=;
while(scanf("%d",&n)!=EOF)
{
for(int i=;i<=n;i++)
{
scanf("%d%d",&x[i].a,&x[i].b);
}
sort(x+,x+n+,cmp);
int num=;
ans[]=x[].b;
for(int j=;j<=n;j++)
{
if(x[j].b>ans[num])
{
num++;
ans[num]=x[j].b;
}
else
{
int pos=upper_bound(ans+,ans+num+,x[j].b)-ans;
ans[pos]=x[j].b;
} }
if(num==) printf("Case %d:\nMy king, at most %d road can be built.\n\n",cnt++,num);
else printf("Case %d:\nMy king, at most %d roads can be built.\n\n",cnt++,num);
}
return ;
}
最新文章
- 严重: Error starting static Resources java.lang.IllegalArgumentException:
- ubuntu中常用软件的安装
- MVC @Html.DropDownList()绑定值
- Linux查找最近修改的文件
- ASP.Net MVC 5 高级编程 第7章 成员资格、授权和安全性
- mysql+heartbeat+DRBD+LVS集群
- sshfs远程文件系统挂载
- JavaScript的DOM编程--07--节点的属性
- [已解决]pycharm的debugger模式不显示调试结果?
- spring boot - 整合jpa
- 基于WanAndroid开放API实现的文章阅读APP
- ESP8266 RTOS SDK烧写环境构建
- WebSocket 协议
- JavaScript之JS单线程|事件循环|事件队列|执行栈
- load balancer does not have available server for client: provider
- 高手写的“iOS 的多核编程和内存管理”
- 后台微信开发入口+关键字 回复等 关注公众号回复 注意获取随机Token 微信的对接校验Token保存到数据库的只是做第一次的校验 其他对微信公众号的操作是去缓存中获取7200S的随机Token
- TCP/IP五层模型详解
- Charles的HTTPS抓包方法及原理,下载安装ssl/https证书
- C#异步编程(五)异步的同步构造