Educational Codeforces Round 1C. Nearest vectors

链接：http://codeforces.com/contest/598/problem/C

题意：给定n个向量，求夹角最小的那一对向量。

分析：直接极角排序然后取夹角最小的那一对即可。注意会卡精度要用long double。

代码：

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=10000010;
const int mod=1000000007;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const ll MAX=1ll<<55;
const double eps=1e-5;
const double inf=~0u>>1;
const double pi=acos(-1.0);
typedef double db;
typedef long double ldb;
typedef unsigned int uint;
typedef unsigned long long ull;
vector<pair<ldb,int>>Q;
int main()
{
    int i,n,a,b;
    ldb x,y,z,mi;
    cin>>n;
    for (i=1;i<=n;i++) {
        cin>>x>>y;
        Q.push_back(make_pair(atan2(y,x),i));
    }
    sort(Q.begin(),Q.end());
    mi=Q[0].first-Q[n-1].first+2*acos(-1.0);
    a=Q[0].second;b=Q[n-1].second;
    for (i=0;i<n-1;i++) {
        z=Q[i+1].first-Q[i].first;
        if (z<mi) {
            mi=z;a=Q[i+1].second;b=Q[i].second;
        }
    }
    cout<<a<<" "<<b<<endl;
    return 0;
}