叉積_判斷點是否在線段上

//判斷點是否在直線上
//如果在直線上，那么這個點和線段兩端點構成的向量的叉積一定==0
//也就是兩個向量共線(obviously)
//那么如果坐標還在兩端點之間的話就是在線段上了 

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;

const int N=1e5+5;
const double eps=1e-8;

inline int read()
{
    char c=getchar();int num=0;
    for(;!isdigit(c);c=getchar());
    for(;isdigit(c);c=getchar())
        num=num*10+c-'0';
    return num;
}

struct Point
{
    double x,y;
    Point(double x=0,double y=0)
    {
        this->x=x,this->y=y;
    }
    Point operator - (const Point &a)
    {
        return Point(this->x-a.x,this->y-a.y);
    }
    double operator * (const Point &a)
    {
        return this->x*a.y-this->y*a.x;
    }
}Q,P1,P2;

int main()
{
    scanf("%lf%lf%lf%lf%lf%lf",&Q.x,&Q.y,&P1.x,&P1.y,&P2.x,&P2.y);
    if(fabs((Q-P1)*(Q-P2))<eps&&min(P1.x,P2.x)-eps<=Q.x&&max(P1.x,P2.x)+eps>=Q.x&&min(P1.y,P2.y)-eps<=Q.y&&max(P1.y,P2.y)+eps>=Q.y)
        puts("Yes");
    else
        puts("No");
    return 0;
}