2018_2_4_City Skyline_栈应用_STL_数大楼

最新推荐文章于 2018-08-16 16:57:46 发布

ujn20161222

最新推荐文章于 2018-08-16 16:57:46 发布

阅读量150

点赞数

本文链接：https://blog.csdn.net/ujn20161222/article/details/79254851

版权

poj 同时被 2 个专栏收录

130 篇文章 0 订阅

订阅专栏

栈

5 篇文章 0 订阅

订阅专栏

s.push(0)不错
City Skyline

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3027		Accepted: 1391

Description

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

Input

* 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.

Output

* Line 1: The minimum number of buildings to create the described skyline.

Sample Input

Sample Output

Hint

INPUT DETAILS:
The case mentioned above

Source

USACO 2005 November Silver

#include<iostream>
#include<cstdio>
#include<stack>
using namespace std;
int main(){
	int n,w;
	scanf("%d%d",&n,&w);
	int a,b;
	stack<int> s;
	int sum=0;
	s.push(0);
	for(int i=0;i<n;i++){
		scanf("%d%d",&a,&b);
		while(s.top()>b){
			s.pop();sum++;
		}if(s.top()<b)
		s.push(b);
	}
	printf("%d\n",sum+s.size()-1);
}