判断点是否在凸包内O(lg(n))：UVALive7281、Hrbust1429

题目：Hrbust1429、UVALive7281

步骤：

1. 先保证凸包点为顺时针或逆时针排序。
2. 由一点向其他点引 n-2条射线，利用叉积二分出q点在哪两条之间。
3. 判断点是在三角形内还是在三角形外。

参考博客：https://www.cnblogs.com/dream-wind/archive/2012/05/23/2514694.html

代码：

#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e5+3;

int n;
int sgn(long long x) {return (x > 0) - (x < 0);}

struct P {
    long long d[3];
    long long& operator[](int x) {
        return d[x];
    }
    P () {}
    P (long long a, long long b, long long c) {
        d[0] = a; d[1] = b; d[2] = c;
    }
}p[N];

P operator+(P a, P b) {return P(a[0]+b[0], a[1]+b[1], a[2]+b[2]);} // a+b
P operator-(P a, P b) {return P(a[0]-b[0], a[1]-b[1], a[2]-b[2]);} // a-b
P operator*(int a, P b) { return P(a*b[0], a*b[1], a*b[2]);} // a*b
bool operator<(P a, P b) { return a[1] < b[1] || (a[1] == b[1] && a[2] < b[2]);}
long long operator*(P a, P b) { return a[1] * b[2] - a[2] * b[1];} // a x b
long long operator^(P a, P b) { return a[1] * b[1] + a[2] * b[2];} // a . b
long long det(P a, P b, P c) { return (b - a) * (c - a);}

int main() {
    while(~scanf("%d", &n)){
        for(int i=0; i<n; i++) scanf("%lld%lld", &p[i][1], &p[i][2]), p[i][0] = 1;
        int m, f=0;
        scanf("%d", &m);
        while(m--){
            P q;
            scanf("%lld%lld", &q[1], &q[2]); q[0] = 1;
            if(f==1) continue;
            int k1 = sgn(det(p[0], p[1], q));
            int k2 = sgn(det(p[0], p[n-1], q));
            if(k1 >= 0 || k2 <= 0) {f = 1; continue;}
            int l=2, r=n-1;
            while(l < r){
                int mid = l+r >> 1;
                if(sgn(det(p[0], p[mid], q)) > 0) r = mid;
                else l = mid+1;
            }
            if(sgn(det(p[l], p[l-1], q)) <= 0) {f=1; continue;}
        }
        if(f==1) puts("NO");
        else puts("YES");
    }
}