City Skyline --(单调队列)
来源:互联网 发布:编辑数据透视图编辑区 编辑:程序博客网 时间:2024/06/05 00:44
The best part of the day for Farmer John's cows is when the sun sets. They can see the skyline of the distant city. Bessie wonders how many buildings the city has. Write a program that assists the cows in calculating the minimum number of buildings in the city, given a profile of its skyline.
The city in profile is quite dull architecturally, featuring only box-shaped buildings. The skyline of a city on the horizon is somewhere between 1 and W units wide (1 <= W <= 1,000,000) and described using N (1 <= N <= 50,000) successive x and y coordinates (1 <= x <= W, 0 <= y <= 500,000), defining at what point the skyline changes to a certain height.
An example skyline could be:
..........................
.....XX.........XXX.......
.XXX.XX.......XXXXXXX.....
XXXXXXXXXX....XXXXXXXXXXXX
and would be encoded as (1,1), (2,2), (5,1), (6,3), (8,1), (11,0), (15,2), (17,3), (20,2), (22,1).
This skyline requires a minimum of 6 buildings to form; below is one possible set of six buildings whose could create the skyline above:
.......................... ..........................
.....22.........333....... .....XX.........XXX.......
.111.22.......XX333XX..... .XXX.XX.......5555555.....
X111X22XXX....XX333XXXXXXX 4444444444....5555555XXXXX
..........................
.....XX.........XXX.......
.XXX.XX.......XXXXXXX.....
XXXXXXXXXX....666666666666
The city in profile is quite dull architecturally, featuring only box-shaped buildings. The skyline of a city on the horizon is somewhere between 1 and W units wide (1 <= W <= 1,000,000) and described using N (1 <= N <= 50,000) successive x and y coordinates (1 <= x <= W, 0 <= y <= 500,000), defining at what point the skyline changes to a certain height.
An example skyline could be:
..........................
.....XX.........XXX.......
.XXX.XX.......XXXXXXX.....
XXXXXXXXXX....XXXXXXXXXXXX
and would be encoded as (1,1), (2,2), (5,1), (6,3), (8,1), (11,0), (15,2), (17,3), (20,2), (22,1).
This skyline requires a minimum of 6 buildings to form; below is one possible set of six buildings whose could create the skyline above:
.......................... ..........................
.....22.........333....... .....XX.........XXX.......
.111.22.......XX333XX..... .XXX.XX.......5555555.....
X111X22XXX....XX333XXXXXXX 4444444444....5555555XXXXX
..........................
.....XX.........XXX.......
.XXX.XX.......XXXXXXX.....
XXXXXXXXXX....666666666666
* Line 1: Two space separated integers: N and W
* Lines 2..N+1: Two space separated integers, the x and y coordinate of a point where the skyline changes. The x coordinates are presented in strictly increasing order, and the first x coordinate will always be 1.
* Lines 2..N+1: Two space separated integers, the x and y coordinate of a point where the skyline changes. The x coordinates are presented in strictly increasing order, and the first x coordinate will always be 1.
* Line 1: The minimum number of buildings to create the described skyline.
10 261 12 25 16 38 111 015 217 320 222 1
6
INPUT DETAILS:
The case mentioned above
The case mentioned above
题意:给出一个轮廓,问组成轮廓的最少楼房个数
很有意思单调队列,创建严格递增单调队列,每有元素出列就说明确定了一个楼房
代码:
#include<iostream>#include<string>#include<cstdio>#include<algorithm>#include<cmath>#include<iomanip>#include<queue>#include<cstring>#include<map>using namespace std;typedef long long ll;#define pi acos(-1.0)#define inf 0x3f3f3f#define M 50005int n,w,q[M],x,y[M];int main(){ int i; scanf("%d%d",&n,&w); for(i=1;i<=n;i++) scanf("%d%d",&x,&y[i]); y[0]=y[n+1]=0; int head=1,tail=0,num=0; //队尾加入0让说有元素出队 for(i=1;i<=n+1;i++) { while(head<=tail&&y[q[tail]]>y[i]) {tail--;num++;} if(y[i]!=y[q[tail]]) q[++tail]=i; //等于时不入队 } printf("%d",num); return 0;}
阅读全文
0 0
- City Skyline --(单调队列)
- City Skyline(单调队列)
- bzoj1628: [Usaco2007 Demo]City skyline(单调队列)
- bzoj 1628: [Usaco2007 Demo]City skyline 单调队列
- [BZOJ1683][Usaco2005 Nov]City skyline 城市地平线(单调栈)
- poj 3044 City Skyline 单调栈
- BZOJ1683: [Usaco2005 Nov]City skyline 城市地平线 单调栈
- BZOJ1683: [Usaco2005 Nov]City skyline 城市地平线 单调栈
- 【BZOJ】1628 [Usaco2007 Demo]City skyline 单调栈
- [HDU 4252] A Famous City[单调队列]
- [单调栈] BZOJ 1113 [Poi2008]海报PLA & BZOJ 1628 [Usaco2007 Demo]City skyline
- BZOJ 1683: [Usaco2005 Nov]City skyline 城市地平线 还是单调栈。。。
- POJ-3044-City Skyline
- poj 3049 City Skyline
- bzoj 1628 && 1683: [Usaco2007 Demo]City skyline(模拟)
- hdu 1505 City Game 最大矩形面积 单调队列
- A Famous City(单调栈)
- hdu1505---City Game(单调栈)
- 面试总结:关于数据库范式的一点理解
- Monkey and Banana HDU
- gson解析字符串toBean
- Eclipse +Scala+Maven+Spark开发模式
- macvlan 网络结构分析
- City Skyline --(单调队列)
- centos7 防火墙使用详解
- uva10673-扩展欧几里得
- codeforces 680D D. Bear and Tower of Cubes(dfs+贪心)
- 虚拟机centos6.4网络连接设置--桥接设置
- River Hopscotch(二分法)
- 二分查找法(折半查找法)的实现
- linux c开发: 处理命令行参数
- 有序数组中和为定值的数字对与和为定值的连续正整数序列