int x = 0;
int y = 10;
int x1 = -10;
int y1 = 0;
int x2 = 10;
int y2 = 0;
// 算法1
double d;
double sq = sqrt((double)y1*y1+(double)x1*x1);
if(sq==0)
d = sqrt((double)x*x+(double)y*y);
else
d = fabs((double)(y1-y2)*x+(double)(x2-x1)*y+(double)x1*y2-(double)x2*y1)/sq;
// 算法2
double a = y2 - y1;
double b = x1 - x2;
double c = x2 * y1 - x1 * y2;
double d = abs(a * x + b * y + c) / sqrt(a * a + b * b);
// 算法3
double d = fabs(double(x2 - x1) * (x - x1) - double(y2 - y1) * (y - y1)) / sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2));