转载自:http://blog.csdn.net/qq_24489717/article/details/50638200
题意:给你N个点,求三个点使得他们围成三角形。而且这个三角形内部没有点。
题解:按照字典序排序,先选取2个点,然后枚举第三个点是否与前2点共线,我是使用斜率去判断是否在一条线上,这里注意一下不要直接求出斜率K,还是移项一下,使用乘积的形式,不然会出现除以0的情况出错
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <algorithm>
#define LL long long
#define inf 0x3f3f3f3f
using namespace std;
#define N 100005
struct point
{
LL x,y;
int org;
};
point convex[N];
bool cmp(const point &x1,const point &x2)
{
if(x2.x!=x1.x)return x1.x<x2.x;
return x1.y<x2.y;
}
bool judge(point &x1,point &x2,point &x3)
{
return ((x2.y-x3.y)*(x1.x-x2.x))!=((x1.y-x2.y)*(x2.x-x3.x));
}
int main()
{
#ifdef CDZSC
freopen("i.txt","r",stdin);
#endif
int n;
while(~scanf("%d",&n))
{
for(int i=0;i<n;i++)
{
scanf("%lld%lld",&convex[i].x,&convex[i].y);
convex[i].org=i+1;
}
sort(convex,convex+n,cmp);
printf("%d %d ",convex[0].org,convex[1].org);
for(int i=2;i<n;i++)
{
if(judge(convex[0],convex[1],convex[i]))
{
printf("%d\n",convex[i].org);
break;
}
}
}
return 0;
}