UVa221 Urban Elevations （离散化）

题目链接

An elevation of a collection of buildings is an orthogonal projection of the buildings onto a vertical plane. An external elevation of a city would show the skyline and the faces of the “visible” buildings of the city as viewed from outside the city from a certain direction. A southern elevation shows no sides; it shows the perfectly rectangular faces of buildings or parts of faces of buildings not obstructed on the south by taller buildings. For this problem, you must write a program that determines which buildings of a city are visible in a southern elevation. For simplicity, assume all the buildings for the elevation are perfect rectangular solids, each with two sides that run directly east-west and two running directly north-south. Your program will find the buildings that appear in a southern elevation based on knowing the positions and heights of each city building. That data can be illustrated by a map of the city as in the diagram on the left below. The southern elevation for that city is illustrated in the diagram on the right. City map. Boldface numbers (in the upper left of each building) identify the buildings. Plain numbers (lower right) are the buildings heights. Southern Elevation (Only the shaded buildings are visible in a southern elevation)

Input
Input for your program consists of the numeric description of maps of several cities. The first line of each map contains the number of buildings in the city (a non-negative integer less than 101). Each subsequent line of a map contains data for a single building — 5 real numbers separated by spaces in the following order: x-coordinate of the southwest corner y-coordinate of the southwest corner width of the building (length of the south side) depth of the building (length of the west side) height of the building Each map is oriented on a rectangular coordinate system so that the positive x-axis points east and the positive y-axis points north. Assume that all input for each map corresponds to a legitimate map (the number of buildings is the same as the number of subsequent lines of input for the map; no two buildings in a single map overlap). Input is terminated by the number 0 representing a map with no buildings.

Output
Buildings are numbered according to where their data lines appear in the map’s input data — building #1 corresponding to the first line of building data, building #2 data to the next line, and building #n to the nth line of building data for that map. (Buildings on subsequent maps also begin their numbering with 1.) For each map, output begins with line identifying the map (map #1, map #2, etc.) On the next line the numbers of the visible buildings as they appear in the southern elevation, ordered south-to-north, west-to-east. This means that if building n and building m are visible buildings and if the southwest corner of building n is west of the southwest corner of building m, then number n is printed before number m. If building n and building m have the same x-coordinate for their southwest corners and if building n is south of building m, then the number n is printed before the number m. For this program, a building is considered visible whenever the part of its southern face that appears in the elevation has strictly positive area. One blank line must separate output from consecutive input records.

1.刚看题很懵，不太会，看了几遍后读懂了lrj思路，自己敲出，算是提升吧

2.首先很重要的一点是任意两个建筑物x坐标要么相同，要么相差很多（不会引起精度问题）

3.任意一个建筑的x和 x+宽度 都要用另一数组记录

4.枚举所有在某一坐标处可见的建筑，只要有再当前建筑南面的并且挡住了该建筑（高度相同也会挡住），就是不可见

代码：

#include <iostream>
#include <algorithm>
using namespace std;
const int maxn=105;
double d[maxn*2];///存所有x坐标
int n; ///建筑物总个数
struct build{
    int id;
    double x,y,w,d,h;
}b[maxn];
bool operator<(const build& b1,const build& b2){
    ///题意要求的排序方式
    if(b1.x==b2.x)
        return b1.y<b2.y;
    return b1.x<b2.x;
}

bool cover(int i,double mx){///判断一个点的宽是否包含坐标mx
    return b[i].x<=mx&&(b[i].x+b[i].w)>=mx;
}
bool visible(int i,double mx){///判断一个点是否可见
    if(!cover(i,mx)) return false;
    for(int j=0;j<n;j++){
        if(b[j].y<b[i].y&&b[j].h>=b[i].h&&cover(j,mx))
            return false;
    }
    return true;
}
int main()
{
    int T=0;
    while(~scanf("%d",&n)&&n){
        for(int i=0;i<n;i++){
            scanf("%lf%lf%lf%lf%lf",&b[i].x,&b[i].y,&b[i].w,&b[i].d,&b[i].h);
            b[i].id=i+1;
            d[2*i]=b[i].x;
            d[2*i+1]=b[i].x+b[i].w;
        }
        sort(b,b+n);
        sort(d,d+n*2);///离散化前要先排序
        int m=unique(d,d+n*2)-d;///找出所有的不重复的x坐标
        if(T++) printf("\n");///输出格式恼人
        printf("For map #%d, the visible buildings are numbered as follows:\n%d",T,b[0].id);///第一个建筑物排在左下角第一个，一定可见
        for(int i=1;i<n;i++){
            bool ans=0;
            for(int j=0;j<m-1;j++){
                if(visible(i,(d[j]+d[j+1])/2)){
                    ans=1;
                    break;
                }
            }
            if(ans) printf(" %d",b[i].id);
        }
        printf("\n");
    }
    return 0;
}