摘要：
看了一些旋转卡壳的资料。理解的还是不深，推荐博客：http://blog.csdn.net/ACMakerPOJ2187裸凸包+旋转卡(qia)壳，O(n^2)的枚举也能过View Code //#pragma comment(linker,"/STACK:327680000,327680000")#include <iostream>#include <cstdio>#include <cmath>#include <vector>#include <cstring>#include <algorithm& 阅读全文
