[半平面交对偶凸包] BZOJ 1007 [HNOI2008]水平可见直线

半平面交对偶转凸包问题
神奇的新姿势 还有待研究

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=50005;
struct P{
  int x,y,idx;
  P(int x=0,int y=0,int idx=0):x(x),y(y),idx(idx) { }
  bool operator < (const P&B) const{ return x==B.x?y<B.y:x<B.x; }
  friend P operator - (P A,P B){ return P(A.x-B.x,A.y-B.y); }
  friend ll operator * (P A,P B){ return (ll)A.x*B.y-(ll)A.y*B.x; }
  friend ll jud(P A,P B,P C) { return (B-A)*(C-A); }
}a[N];
int Q[N],r;
int n,ans[N];

int main(){
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); for (int i=1;i<=n;i++) read(a[i].x),read(a[i].y),a[i].y=-a[i].y,a[i].idx=i;
  sort(a+1,a+n+1);
  for (int i=1;i<=n;i++)
    if (a[i].x!=a[i-1].x){
      while (r>1 && jud(a[Q[r-1]],a[Q[r]],a[i])<=0) r--; Q[++r]=i;
    }
  for (int i=1;i<=r;i++) ans[a[Q[i]].idx]=1;
  for (int i=1;i<=n;i++) if (ans[i]) printf("%d ",i);
  return 0;
}