这题应该可以算是一道半平面交的入门铺垫题(阉割版),因为每条直线确定的平面都位于其上方,所以免去了向量的麻烦。具体方法就是先按照斜率排序,判断新加入的直线与栈顶直线交点是否在之前的栈顶与栈顶下面的直线交点的左侧,如果在左侧就弹掉栈顶。多条斜率相同的直线则取b最大的一个。
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<iostream>
#include<iomanip>
#include<ctime>
#include<cmath>
#include<algorithm>
using namespace std;
const double eps=1e-9;
struct point
{
double x,y;
point(double _,double __):x(_),y(__){}
};
struct line
{
int num;
double k,b;
bool operator < (line mid) const
{
return ((k<mid.k) || (k==mid.k && b<mid.b));
}
point operator ^ (line mid) const
{
double midx=(mid.b-b)/(k-mid.k);
double midy=midx*k+b;
return point(midx,midy);
}
}my_stack[100000],lines[100000];
bool cmp(line a,line b)
{
return a.num<b.num;
}
int top=0;
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%lf%lf",&lines[i].k,&lines[i].b);
lines[i].num=i;
}
sort(lines+1,lines+1+n);
double x=0;
for(int i=1;i<=n;i++)
{
while(abs(lines[i+1].k-lines[i].k)<=eps && i+1<=n) i++;
double nx=0;
if(top!=0) nx=(lines[i]^my_stack[top]).x;
while(nx-x<=eps && top>=2)
{
top--;
if(top!=1) x=(my_stack[top]^my_stack[top-1]).x;
nx=(lines[i]^my_stack[top]).x;
}
x=nx;
my_stack[++top]=lines[i];
}
sort(my_stack+1,my_stack+1+top,cmp);
for(int i=1;i<=top;i++) printf("%d ",my_stack[i].num);
cout<<endl;
return 0;
}