等待最好的两个人！

摘要： 题目链接：http://poj.org/problem?id=3608#include#include#include#include#include#includeusing namespace std;const int maxn = 10500;const int maxe = 100000;const int INF = 0x3f3f3f;const double eps = 1e-8;const double PI = acos(-1.0);struct Point{ double x,y; Point(double x=0, double y=0) : x(x),y(y... 阅读全文

摘要： 题目链接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4199没想透为啥旋转卡壳跟枚举跑时间差不多。n太小吧！枚举法：#include#include#include#include#include#includeusing namespace std;const int maxn = 100050;const int maxe = 100000;const int INF = 0x3f3f3f;const double ep 阅读全文

摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4666#include #include #include #include #include #include using namespace std;const int maxn = 60060;struct MaxHeap{ int d; //k维的各种加或减的和； int p; //每个坐标和所属的标号 MaxHeap(int d=0,int p=0):d(d),p(p) {} boo... 阅读全文

摘要： 题目链接：http://poj.org/problem?id=2926#include#include#include#include#include#include#includeusing namespace std;const int INF = 0x3f3f3f;float Max[32]; //Max[i]表示第i种的最大；float Min[32];int N;int main(){ //freopen("E:\\acm\\input.txt","r",stdin); cin>>N; for(int i=0;i<32;i++ 阅读全文

摘要： 题目链接：http://poj.org/problem?id=2187旋转卡壳算法：http://www.cppblog.com/staryjy/archive/2009/11/19/101412.html或 http://cgm.cs.mcgill.ca/~orm/rotcal.frame.html#include#include#include#include#include#includeusing namespace std;const int maxn = 55000;const int maxe = 100000;const int INF = 0x3f3f3f;const dou 阅读全文

摘要： 题目链接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1593#include#include#include#include#include#includeusing namespace std;const int maxn = 606;const int maxe = 100000;const int INF = 0x3f3f3f;const double eps = 1e-8;const double PI = acos 阅读全文

摘要： 题目链接：http://poj.org/problem?id=2318#include#include#include#include#include#includeusing namespace std;const int maxn = 5105;const int maxe = 20000;const int INF = 0x3f3f3f;const double eps = 1e-8;const double PI = acos(-1.0);struct Point{ double x,y; Point(double x=0, double y=0) : x(x),y(y){... 阅读全文

摘要： 题目链接：http://poj.org/problem?id=1269#include#include#include#include#include#includeusing namespace std;const int maxn = 105;const int maxe = 20000;const int INF = 0x3f3f3f;const double eps = 1e-8;const double PI = acos(-1.0);struct Point{ double x,y; Point(double x=0, double y=0) : x(x),y(y){ ... 阅读全文

摘要： 题目链接：http://poj.org/problem?id=3304#include#include#include#include#include#includeusing namespace std;const int maxn = 105;const int maxe = 20000;const int INF = 0x3f3f3f;const double eps = 1e-8;const double PI = acos(-1.0);struct Point{ double x,y; Point(double x=0, double y=0) : x(x),y(y){ ... 阅读全文

摘要： 题目链接：http://poj.org/problem?id=1556#include#include#include#include#include#includeusing namespace std;const int maxn = 1000;const int maxe = 20000;const int INF = 0x3f3f3f;const double eps = 1e-8;const double PI = acos(-1.0);struct Point{ double x,y; Point(double x=0, double y=0) : x(x),y(y){... 阅读全文