HDU 5033 Building 单调栈 2014网络赛北京站B题

题目：点击打开链接

题意：二维数轴上有n个位置为x垂直于x轴高为h的线段，q个询问问在（xq，0）这一点上能看到天空的最大角度。

思路：把一些无用的数据处理出来成为单调栈，暴力。在网上看了很多貌似很高大上优化，只要是极端数据都是常数级优化。

cpp：

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
using namespace std;
void read_int(int& a)
{
    char c;
    while (c=getchar(),c>'9'||c<'0');
    a=c-'0';
    while (c=getchar(),c>='0'&&c<='9')
        a=a*10+c-'0';
}
struct Building{
    int high,x;
    int  rank;
    bool is_building;
};
struct Man{
    double right,left,ans;
    Building fa;
    vector <Building> son;
    void get_ans()
    {
//                printf("%f %f\n",left,right);
        ans=1-(atan(left)+atan(right))/acos(-1);
        ans*=180;
        //    cout<<ans<<endl;
    }
};
vector <Building> build;
vector <Man> ans;
int n,q;
bool cmp_x(Building a,Building b)
{
    return a.x<b.x;
}
void get()
{
    sort(build.begin(),build.end(),cmp_x);
    for(int i=0;i<n+q;i++)
    {
    //        cout<<build[i].x<<" "<<build[i].high<<" "<<endl;
        if(!build[i].is_building)
        {
            int sta=build[i].rank;
            for(int j=i-1;j>=0;j--)
            {
                if(!build[j].is_building)
                {
                    int son_sta=build[j].rank;
                    int sz=ans[son_sta].son.size();
                    for(int k=0;k<sz;k++)
                    {
                        if(ans[son_sta].son[k].high>ans[sta].son.back().high)
                        {
                            for (int fk=k;fk<sz;fk++)
                            {
                                ans[sta].son.push_back(ans[son_sta].son[fk]);
                            }
                            break;
                        }
                    }
                    break;
                }
    //                                cout<<build[j].high<<" "<<build[j].x<<endl;
                if(build[j].high>ans[sta].son.back().high)
                {
                    ans[sta].son.push_back(build[j]);
                }
            }
        }
    }
}
void flip_over()
{
    int tp_x=build.back().x+1;
    for(int i=0;i<n+q;i++)
    {
        build[i].x=tp_x-build[i].x;
    }
    for(int i=0;i<q;i++)
    {
        ans[i].son.clear();
        ans[i].fa.x=tp_x-ans[i].fa.x;
        ans[i].son.push_back(ans[i].fa);
    }
}
void slove()
{
    get();
    for(int i=0;i<ans.size();i++)
    {
        ans[i].left=0;

        for(int j=1;j<ans[i].son.size();j++)
        {
            double dx=ans[i].fa.x-ans[i].son[j].x;
			int dy=ans[i].son[j].high;
            ans[i].left=max(ans[i].left,dy/dx);
        }
    }
    flip_over();
    get();
    for(int i=0;i<ans.size();i++)
    {
        ans[i].right=0;
        for(int j=1;j<ans[i].son.size();j++)
        {
            double dx=ans[i].fa.x-ans[i].son[j].x;
			int dy=ans[i].son[j].high;
            ans[i].right=max(ans[i].right,dy/dx);
        }
    }
    for(int i=0;i<ans.size();i++)
    {
        ans[i].get_ans();
        printf("%.10f\n",ans[i].ans);
    }
    return ;
}
void init()
{
    ans.clear();
    build.clear();
    read_int(n);
    for(int i=0;i<n;i++)
    {
        Building temp;
        temp.is_building=1;
        read_int(temp.x);
        read_int(temp.high);
        build.push_back(temp);
    }
    read_int(q);
    for(int i=0;i<q;i++)
    {
        Building temp;
		Man tp;
        temp.is_building=0;
        temp.rank=i;
		temp.high=0;
        read_int(temp.x);
        build.push_back(temp);
        tp.fa=temp;
        tp.son.push_back(temp)    ;
        ans.push_back(tp);
    }
}
int main()
{
    int T,cas=0;
	//   freopen("data.in","r",stdin);
    scanf("%d",&T);
    while (T--)
    {
        printf("Case #%d:\n",++cas);
        init();
        slove();
    }
    return 0;
}