Codeforces 598C Nearest vectors

                   C. Nearest vectors
              time limit per test2 seconds
             memory limit per test256 megabytes
             inputstandard input
             outputstandard output
You are given the set of vectors on the plane, each of them starting at the origin. Your task is to find a pair of vectors with the minimal non-oriented angle between them.

Non-oriented angle is non-negative value, minimal between clockwise and counterclockwise direction angles. Non-oriented angle is always between 0 and π. For example, opposite directions vectors have angle equals to π.

Input
First line of the input contains a single integer n (2 ≤ n ≤ 100 000) — the number of vectors.

The i-th of the following n lines contains two integers xi and yi (|x|, |y| ≤ 10 000, x2 + y2 > 0) — the coordinates of the i-th vector. Vectors are numbered from 1 to n in order of appearing in the input. It is guaranteed that no two vectors in the input share the same direction (but they still can have opposite directions).

Output
Print two integer numbers a and b (a ≠ b) — a pair of indices of vectors with the minimal non-oriented angle. You can print the numbers in any order. If there are many possible answers, print any.

Examples
inputCopy
4
-1 0
0 -1
1 0
1 1
outputCopy
3 4
inputCopy
6
-1 0
0 -1
1 0
1 1
-4 -5
-4 -6
outputCopy
6 5

一个函数

函数声明：

long double atan2(long double y,long double x) 
返回的是原点至点(x,y)的方位角，即与 x 轴正向的夹角。也可以理解为复数 x+yi 的辐角。

返回值的单位为弧度，取值范围为 (-PI,PI]。

思路
利用atan2计算每个点（代表的也就是那个向量）与x轴正向的夹角，并按照夹角从小到大排序，然后就只要扫一遍计算每相邻两个向量之间的夹角即可（最小值只可能在相邻两个中产生，可以用反证法证明）。
除此之外，还需要注意第一个与最后一个向量之间的夹角关系，特殊计算以下即可。
注意：这道题精度要求很高，要用long double，并且我交了两次一次WA一次AC，也不知道为啥，看样例输出的结果和它的答案不相等，但是算出来的最小角度相等，但是被判定为WA，第二次却A了。。搞不懂

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int Max = 100005;
const long double PI = acos(-1.0);
struct vec
{
    long double angle;
    int index;
}vecs[Max];
int n;
long double x, y;
 
inline bool cmp(vec v1, vec v2)
{
    return v1.angle < v2.angle;
}
 
 
int main()
{
    while(~scanf("%d", &n))
    {
        for(int i = 0; i < n; i++)
        {
            scanf("%Lf %Lf", &x, &y);
            vecs[i].angle = atan2(y, x);        // 返回与X轴正向的夹角
            vecs[i].index = i + 1;
        }
        sort(vecs, vecs + n, cmp);
        long double mini = 2 * PI, tmp;
        int index1, index2;
        for(int i = 0; i < n - 1; i++)
        {
            tmp = vecs[i + 1].angle - vecs[i].angle;
            if(tmp < mini)
            {
                mini = tmp;
                index1 = vecs[i].index;
                index2 = vecs[i + 1].index;
            }
        }
        long double x = 2 * PI + vecs[0].angle - vecs[n - 1].angle;
        if(x < mini)
        {
            index1 = vecs[0].index;
            index2 = vecs[n - 1].index;
        }
        printf("%d %d\n", index1, index2);
    }
}