圆排列

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <functional>

using namespace std;
double *x, *r, Min = 9999;
int n = 3;

//计算出当前t圆的横坐标
double center(int t) {
    double temp = 0;
    for (int i = 0; i < t; i++) {
        //由勾股定理推导出两个圆心之间的距离
        double valueX = x[i] + 2.0 * sqrt(r[i] * r[t]);
        temp = max(valueX, temp);
    }
    return temp;
}

//从0开始
void backtrack(int t) {
    if (t >= n) {
        double low = 0, high = 0;
        for (int i = 0; i < n; i++) {
            if (x[i] - r[i] < low)
                low = x[i] - r[i];
            if (x[i] + r[i] > high)
                high = x[i] + r[i];
        }
        Min = min(high - low, Min);
    } else {
        //前面t个圆已经排列好了
        for (int i = t; i < n; i++) {
            //讲t号位置的圆和t号位置以后的每个圆进行交换位置
            swap(r[t], r[i]);
            if (center(t) + r[t] + r[0] < Min) {
                x[t] = center(t);
                backtrack(t + 1); //填下个位置,也就是t+1号位置
            }
            swap(r[t], r[i]);

        }
    }

}


int main() {
    x = new double[3];
    r = new double[3];
    r[0] = 1;
    r[1] = 1;
    r[2] = 2;

    memset(x, 0, sizeof(x));
    backtrack(0);
    printf("%.3f\n", Min);
    delete[] x;
    delete[] r;
    return 0;
}