Codeforces - Wunder Fund Round 2016 (Div. 1 + Div. 2 combined)C - Constellation（数学练习）_codeforces wunder fund round winter-CSDN博客

本文链接：https://blog.csdn.net/j6635788/article/details/50611826

Cat Noku has obtained a map of the night sky. On this map, he found a constellation withn stars numbered from1 to n. For eachi, the i-th star is located at coordinates(x_i, y_i). 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 integersx_i andy_i ( - 10⁹ ≤ x_i, y_i ≤ 10⁹).

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.

Sample test(s)

Input

Output

1 2 3

Input

Output

1 3 5

Note

In the first sample, we can print the three indices in any order.

In the second sample, we have the following picture.

$\text{[math]}$

Note that the triangle formed by starts 1, 4 and 3 doesn't satisfy the conditions stated in the problem, as point5 is not strictly outside of this triangle (it lies on it's border).

这道题目过了还是很开心的，因为发现如果比赛的话我应该是可以成功hack别人的，嘿嘿嘿，终于能给CF补数据了！内心无比激动中~~~~~~~

题意：给出N个点，取其中某三个点组成一个三角形，并使其余所有点都严格在该三角形之外，题目保证此三角形存在

本来我是求出所有点到第1个点的距离，然后排序取最小的两个距离输出他们的index，于是成功wa 23333。然后发现要考虑这三个点可能在一条线上，于是很冒险的保留第1个点和最小距离点不动，判断第三个点是否与他们同线，若同线则往后取。本来不期望能过，因为第三个点一旦不是次小，就会有风险，使得二三点连线时包围那个次小的点，但是没想到AC了咩哈哈哈哈哈哈

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <stdlib.h>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <functional>
#include <vector>
#include <fstream>
#include <iomanip>
using namespace std;

struct node
{
  int index;
  int x, y;
  long long dis;
}a[100005];

bool cmp(node a, node b)
{
  if(a.dis == b.dis)
    return a.index < b.index;
  return a.dis < b.dis;
}

int main()
{
  int n;
  while(scanf("%d", &n) != EOF){
    for(int i = 0; i < n; i++){
      scanf("%d%d", &a[i].x, &a[i].y);
      a[i].index = i + 1;
    }
    long long mmm, nnn;
    a[0].dis = 0;
    for(int i = 1; i < n; i++){
      mmm = (long long)(a[i].x - a[0].x) * (a[i].x - a[0].x);
      nnn = (long long)(a[i].y - a[0].y) * (a[i].y - a[0].y);
      a[i].dis = mmm + nnn;
    }
    sort(a, a + n, cmp);
    int k = a[2].index;
    for(int i = 2; i < n; i++){
      mmm = (long long)(a[0].y - a[1].y) * (a[0].x - a[i].x);
      nnn = (long long)(a[0].x - a[1].x) * (a[0].y - a[i].y);
      if(mmm != nnn){
        k = i;
        break;
      }
    }
    printf("%d %d %d\n", a[0].index, a[1].index, a[k].index);
  }
  return 0;
}