Constructing Roads In JGShining's Kingdom(HDU 1025 LIS nlogn方法)
Constructing Roads In JGShining's Kingdom
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21002 Accepted Submission(s): 5935
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.
My king, at most 1 road can be built.
My king, at most 2 roads can be built.
Huge input, scanf is recommended.
这里注意一下模板写法。数组下表从a到b时,l=a-1,r=b+1,while(r-l>1)
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
#define Max 500005
int dp[Max];
struct node
{
int p,r;
}a[Max];
bool cmp(node x,node y)
{
return x.p<=y.p;
}
int main()
{
int i,j;
int n;
int t=;
freopen("in.txt","r",stdin);
while(scanf("%d",&n)!=EOF)
{
int maxn=;
for(i=;i<n;i++)
scanf("%d%d",&a[i].p,&a[i].r);
sort(a,a+n,cmp);
for(i=;i<n;i++)
dp[i]=Max;
/*for(i=0;i<n;i++)
*lower_bound(dp,dp+n,a[i].r)=a[i].r;
int p=lower_bound(dp,dp+n,Max)-dp;
if(p==1)
printf("Case %d:\nMy king, at most %d road can be built.\n\n",t++,1);
else
printf("Case %d:\nMy king, at most %d roads can be built.\n\n",t++,p);*/
for(i=;i<n;i++)
{ int l=-,r=n,m;
while(r-l>)
{
m=(l+r)/;
if(dp[m]>=a[i].r)
r=m;
else
l=m;
}
dp[r]=a[i].r;
}
int l=-,r=n,m;
while(r-l>)
{
m=(l+r)/;
if(dp[m]>=Max)
r=m;
else
l=m;
}
int p=r;
if(p==)
printf("Case %d:\nMy king, at most %d road can be built.\n\n",t++,);
else
printf("Case %d:\nMy king, at most %d roads can be built.\n\n",t++,p);
}
return ;
}
最新文章
- sql学习
- 【MySQL】MySQL 5.7+ 版本的初始化
- mybatis 复习笔记03
- 浅谈线程池(中):独立线程池的作用及IO线程池
- android107 指针入门
- Linux编辑器的选择使用
- form WebBrowser自动点击弹出提示框alert、弹出对话框confirm、屏蔽弹出框、屏蔽弹出脚本错误的解决办法
- 格而知之8:我所理解的Runtime(3)
- ASP.NET、HTML+CSS - 弹出提示窗体
- android学习8——获取view在屏幕上的绝对坐标
- Java基础笔记6
- Fiddler的hosts配置使用
- 扫码下单支持同桌单人点餐FAQ
- commons-dbcp2 新版本2.6使用连接池在关闭服务器的时候会有内存溢出的BUG....
- Oracle基础
- Structured Streaming教程(1) —— 基本概念与使用
- MySQL 常用使用语句
- vue +bootstrap 写的小例子
- Mac安装jdk1.6
- ThinkPHP 模型方法 getField() 和 select() 使用技巧