求包含点集的最小正方形个数。

把枚举数量减少下来，这里用到逼近迭代，就是先m分枚举范围，从中找到最小的，然后再在那个区间m分，这样迭代下去。

#include <iostream>
#include <math.h>
using namespace std;
const int MAX = 305;
const double PI = asin(1.0) * 2;
const double EPS = 1e-6;
int n;
double x[MAX];
double y[MAX];
double xx[MAX];
double yy[MAX];
double check(double a)
{
    double minx = 1000000;
    double maxx = -minx;
    double miny = minx;
    double maxy = maxx;
    for(int i = 0; i < n; i++)
    {
        xx[i] = cos(a) * x[i] + sin(a) * y[i];
        yy[i] = -sin(a) * x[i] + cos(a) * y[i];
        minx = min(minx, xx[i]);
        maxx = max(maxx, xx[i]);
        miny = min(miny, yy[i]);
        maxy = max(maxy, yy[i]);
    }
    double e = (maxx - minx) > (maxy - miny) ? (maxx - minx) : (maxy - miny);
    return e * e;
}
double go()
{
    int m = 800;
    int times = 60;
    double begin = 0;
    double end = PI / 3;
    double res = -1;
    double from;
    double a;
    double da;
    while(times--)
    {
        a = begin;
        da = (end - begin) / m;
        for(int i = 0; i < m; i++)
        {
            double t = check(a + da * i);
            if(res == -1 || t < res)
            {
                res = t;
                from = a + da * i;
            }
        }
        begin = from - da;
        end = from + 2 * da;
    }
    return res;
}
int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d", &n);
        for(int i = 0; i < n; i++)
            scanf("%lf%lf", &x[i], &y[i]);
        printf("%.2lf\n", go());
    }
}