uva 10012 How Big Is It? (greedy + enumerate)

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=953

　　这道题是比较简单的枚举加上贪心的题目，题意是将n个圆放进矩形内，要求圆要贴着矩形的底部，问矩形的长最小是多少。

　　题目需要注意的是有可能有两个半径非常大的圆夹着两个半径非常小的圆的情况，除此之外，代码都很简单。

代码如下：

#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP_1(i, n) for (int i = 1; i <= (n); i++)

int idx[10];
double R[10], pos[10];

double cal(int n) {
    n--;
    pos[0] = 0.0;
    REP_1(i, n) {
        double tmp = -finf;
        REP(j, i) {
            tmp = max(tmp, pos[j] + sqrt(sqr(R[idx[i]] + R[idx[j]]) - sqr(R[idx[i]] - R[idx[j]])));
        }
        pos[i] = max(R[idx[i]] - R[idx[0]], tmp);
    }
    double ret = 0.0;
    REP(i, n + 1) ret = max(ret, pos[i] + R[idx[i]]);
    return R[idx[0]] + ret;
}

double work(int n) {
    double ret = finf;
    REP(i, n) idx[i] = i;
    do {
        ret = min(ret, cal(n));
    } while (next_permutation(idx, idx + n));
    return ret;
}

int main() {
    int T, n;
    scanf("%d", &T);
    while (T-- && scanf("%d", &n)) {
        REP(i, n) scanf("%lf", &R[i]);
        printf("%.3f\n", work(n));
    }
    return 0;
}

 

——written by Lyon