维护一个下凹的凸包即可,判断该直线是都可行时直接判断当前直线和栈顶直线的交点是否在栈顶第2条直线的上面,若在上面,当前直线可行,若在下面,则while出栈,判断位置直接用坐标即可(网上都是叉积吧)
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn=50010;
int n,topt,num;
long long ans[maxn],sta[maxn];
struct da {long long k,b;int id;}a[maxn],c[maxn];
bool cmp(da aa,da bb)
{if (aa.k==bb.k) return aa.b>bb.b;return aa.k<bb.k;}
inline bool ok(da m,da n,da l)
{return (n.b-l.b)*(l.k-m.k)+(l.k-n.k)*(l.b-m.b)>0;}
int main()
{
//freopen("1.in","r",stdin);
//freopen("my.out","w",stdout);
scanf("%d",&n);
for (int i=1;i<=n;i++)
scanf("%lld%lld",&a[i].k,&a[i].b),a[i].id=i;
sort(a+1,a+n+1,cmp);
for (int i=1;i<=n;i++)
{
c[++topt].k=a[i].k; c[topt].b=a[i].b; c[topt].id=a[i].id;
int j=i;
while (a[j+1].k==a[i].k) j++;
i=j;
}
if (topt==1) {printf("%d \n",c[1].id); return 0;}
sta[1]=1; sta[2]=2; num=2;
for (int i=3;i<=topt;i++)
{
while (!ok(c[sta[num-1]],c[sta[num]],c[i]) && num>1)
{num--; if (num==1) break;}
sta[++num]=i;
}
for (int i=1;i<=num;i++) ans[i]=c[sta[i]].id;
sort(ans+1,ans+num+1);
for (int i=1;i<=num;i++) printf("%d ",ans[i]);
return 0;
}
/*
4
0 -1
1 0
2 1
-1 2
*/