解题思路:
所有的点无非有四种情况
1.在线的上方 且符号为A
2.在线的下方 且符号为A
3.在线的上方 且符号为B
4.在线的下方 且符号为B
设置变量 num1 num2 num3 num4 分别用来统计所给点满足这四种情况的数目。判断只要num1 num2 num3 num4中只要有两个等于0的话,我就认为这条线可以完美的分隔。
#include "iostream"
#include "stdlib.h"
using namespace std;
class Point
{
public:
int x;
int y;
char Type;
int sign;
};
class Line
{
public:
int c0,c1,c2;
};
int main()
{
int PointNum = 0; //点的数目
int LineNum = 0; //线的数目
int i = 0;
int j = 0;
cin>>PointNum;
cin>>LineNum;
int num1 = 0, num2 = 0,num3 = 0,num4 = 0,num0 = 0;
int Anum = 0, Bnum = 0;
Point *point = NULL;
point = (Point *)malloc(sizeof(Point) * (PointNum + 1));
if(point == NULL)
{
return 0;
}
Line *line = NULL;
line = (Line *)malloc(sizeof(Line) * (LineNum + 1));
if(line == NULL)
{
return 0;
}
for(i = 0;i < PointNum;i++)
{
cin>>point[i].x>>point[i].y>>point[i].Type;
}
for(i = 0; i < LineNum;i++)
{
cin>>line[i].c0>>line[i].c1>>line[i].c2;
}
for(i = 0;i < LineNum;i++)
{
num0 = 0;
num1 = 0;
num2 = 0;
num3 = 0;
num4 = 0;
for(j = 0;j < PointNum;j++)
{
if(line[i].c0 + line[i].c1 * point[j].x + line[i].c2 * point[j].y > 0 && point[j].Type == 'A')
{
point[j].sign = 1;
}
else if(line[i].c0 + line[i].c1 * point[j].x + line[i].c2 * point[j].y > 0 && point[j].Type == 'B')
{
point[j].sign = 2;
}
else if(line[i].c0 + line[i].c1 * point[j].x + line[i].c2 * point[j].y < 0 && point[j].Type == 'A')
{
point[j].sign = 3;
}
else if(line[i].c0 + line[i].c1 * point[j].x + line[i].c2 * point[j].y < 0 && point[j].Type == 'B')
{
point[j].sign = 4;
}
}
for(j = 0;j < PointNum;j++)
{
if(point[j].sign == 1)
{
num1++;
}
else if(point[j].sign == 2)
{
num2++;
}
else if(point[j].sign == 3)
{
num3++;
}
else if(point[j].sign == 4)
{
num4++;
}
}
if(num1==0)
{
++num0;
}
if(num2 == 0)
{
++num0;
}
if(num3 == 0)
{
++num0;
}
if(num4 == 0)
{
++num0;
}
if(num0 == 2)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
}
system("pause");
return 0;
}
对此思路不清楚的欢迎私信