A - A CodeForces - 618C

LqingX

于 2019-02-19 09:44:24 发布

阅读量164

点赞数

分类专栏： Virtual Judge ——小白成长比赛

本文链接：https://blog.csdn.net/weixin_43892738/article/details/87688747

版权

Virtual Judge ——小白成长比赛专栏收录该内容

24 篇文章 1 订阅

订阅专栏

Cat Noku has obtained a map of the night sky. On this map, he found a constellation with n stars numbered from 1 to n. For each i, the i-th star is located at coordinates (xi, yi). No two stars are located at the same position.

In the evening Noku is going to take a look at the night sky. He would like to find three distinct stars and form a triangle. The triangle must have positive area. In addition, all other stars must lie strictly outside of this triangle. He is having trouble finding the answer and would like your help. Your job is to find the indices of three stars that would form a triangle that satisfies all the conditions.

It is guaranteed that there is no line such that all stars lie on that line. It can be proven that if the previous condition is satisfied, there exists a solution to this problem.

Input
The first line of the input contains a single integer n (3 ≤ n ≤ 100 000).

Each of the next n lines contains two integers xi and yi ( - 109 ≤ xi, yi ≤ 109).

It is guaranteed that no two stars lie at the same point, and there does not exist a line such that all stars lie on that line.

Output
Print three distinct integers on a single line — the indices of the three points that form a triangle that satisfies the conditions stated in the problem.

If there are multiple possible answers, you may print any of them.

Examples
Input
3
0 1
1 0
1 1
Output
1 2 3
Input
5
0 0
0 2
2 0
2 2
1 1
Output
1 3 5

题目大意：

以样例一为例哈
第一行为数据的组数n
后面n行为 n个点坐标
求找出三个点构成一个三角形，其余点坐标都在该三角形的外面，输出在外面点坐标的序号

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include<bits/stdc++.h>
using namesaace std;
#include<bits/stdc++.h>
using namespace std;
struct node
{
   long long  x, y;
   int num;
}p[100010];
bool cmp(node s1,node s2)
{
	if(s1.x==s2.x)
	return s1.y<s2.y;
	return s1.x<s2.x;
}
int judge(node s)
{
   if((p[1].y - s.y)*(p[2].x - s.x) == (p[2].y - s.y) * (p[1].x - s.x)) //判断改点是否与第一个和第二个点平衡
   {
      return false;
   }
   else return true;
}
int main()
{
   int n;
   while(~scanf("%d", &n))
   {
   for(int i=1;i<=n;i++)
   {
      scanf("%lld %lld", &p[i].x, &p[i].y);
      p[i].num = i;
   }
   sort(p+1,p+1+n, cmp);
   if(n==3)
   {
     printf("1 2 3\n");
   }
   else
   {
      for(int i=3;i<=n;i++)
      {
         if(judge(p[i]))
         {
             printf("%d %d %d\n", p[1].num, p[2].num, p[i].num);
             break;
         }
      }
   }
   }
   return 0;
}