摘要:
题目:http://acm.hdu.edu.cn/showproblem.php?pid=4007给定一些点和一个正方形,求正方形能圈住的最多点数。参考了P103的黑书。View Code #include <stdio.h>#include <algorithm>using namespace std;typedef struct{ int x, y;} point;bool cmp(point a, point b){ if (a.x == b.x) return a.y < b.y; return a.x < b.x;}bool cmp2(point 阅读全文
posted @ 2011-09-07 23:43 紫华弦筝 阅读(145) 评论(0) 推荐(0) 编辑