判断点是否在三角形内

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const double eps=1e-6;
struct node
{
    double x,y;
};
double dis(node a,node b)//算距离
{
    double dx=a.x-b.x;
    double dy=a.y-b.y;
    return sqrt(dx*dx+dy*dy);
}
double area(node a,node b,node c)//算面积
{
    double dab=dis(a,b);
    double dac=dis(a,c);
    double dbc=dis(b,c);
    double half=(dab+dac+dbc)/2;
    return sqrt(half*(half-dab)*(half-dac)*(half-dbc));
}
bool isinside(node a,node b,node c,node Q)//Q是否在三角形ABC内
{
    double dabc=area(a,b,c);
    double dabq=area(a,b,Q);
    double dacq=area(a,c,Q);
    double dbcq=area(b,c,Q);
    if(fabs(dabc-dabq-dacq-dbcq)<eps) return true;
    return false;
}
int main()
{
    node a,b,c,q;

    while(~scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&a.x,&a.y,&b.x,&b.y,&c.x,&c.y,&q.x,&q.y))
    {
        if(isinside(a,b,c,q)) puts("Yes");
        else puts("No");
    }
}