bzoj 1007 [HNOI2008]水平可见直线 单调栈 and 下凸

题意：给你n个线段 ，问你从无穷高能看到多少个直线？

解：在纸上简单画一下，单调栈维护下凸的直线

1.斜率排序，单调栈（对于同一个斜率的kx+b，b大的放前面）

#include<bits/stdc++.h>
using namespace std;
#define en '\n'
#define ll long long
#define pb push_back
ll mo;
const ll maxn =1e5+10;
const ll  inf = 1e8;
const double eps=1e-6;
struct node{
double x,y;
int ind;
}line[maxn];
int sta[maxn],sp,n;
bool cmp(node a,node b){
    if(a.x==b.x)return a.y>b.y;
    return a.x<b.x;
}
bool ok(int x,int y,int z){
    double cx=( (double)line[y].y-line[x].y)/((double)line[x].x-line[y].x);
    double zhong=cx*line[y].x+line[y].y;
    double hou=cx*line[z].x+line[z].y;
    if(fabs(hou-zhong)<eps)return 1;
    if(hou>zhong)return 1;
    return 0;
}
vector<int>vec;
signed main()
{
#ifdef local
freopen("input2.txt","r",stdin);
#endif // local
    cin>>n;
    for(int i=1;i<=n;i++){
        scanf("%lf%lf",&line[i].x,&line[i].y);
        line[i].ind=i;
    }
    sort(line+1,line+1+n,cmp);
    for(int i=1;i<=n;i++){
        if(i>1 and line[i].x==line[i-1].x and line[i].y<line[i-1].y)continue;
        while(sp>1 and ok(sta[sp-1],sta[sp],i))sp-=1;
        sta[++sp]=i;
    }
    for(int i=sp;i>=1;--i){
        vec.pb(line[sta[i]].ind);
    }
    sort(vec.begin(),vec.end());
    for(int i=0;i<vec.size();i++){
        cout<<vec[i]<<' ';
    }
    return 0;
}