摘要： http://poj.org/problem?id=3714#include "stdio.h"#include "cmath"#include "iostream"#include "algorithm"using namespace std;struct point{ long long x, y; bool flag;};point p[200003];point tp[200003];bool cmp_x(const point & a, const point & b) { return 阅读全文

摘要： hdu 1007 Quoit Design (最近点对)http://acm.hdu.edu.cn/showproblem.php?pid=1007“最近点对”的经典入门题所用到的思想和“归并排序”类似， 分治再合并。#include "stdio.h"#include "cmath"#include "iostream"#include "algorithm"using namespace std;struct point {double x, y;};point p[100003];point tp[10000 阅读全文