HDU 1455 Sticks(DFS)

Sticks

#include <bits/stdc++.h>
using namespace std;

const int maxn = 70;
int n, sumv, target, aim;//target表示目标的棍子个数，aim表示目标的棍子长度

int stick[maxn], vis[maxn];
bool cmp(int a, int b) {
    return a > b;
}

void init() {
    sumv = 0;
    for(int i = 0; i < n; i++) {
        cin >> stick[i];
        sumv += stick[i];
    }
    sort(stick, stick+n, cmp);
}

bool dfs(int cnt, int len, int pos, int used) {
    if(cnt == target && used == n)
        return true;

    if(len == aim)
        return dfs(cnt+1, 0, 0, used);

    for(int i = pos; i < n; i++) { //从大到小排序后，按顺序搜索
        if(!vis[i] && len+stick[i] <= aim) {
            vis[i] = 1;

            if(dfs(cnt, len+stick[i], i+1, used+1))
                return true;

            vis[i] = 0;

            if(len == 0)
                return false; //如果第一根失败则剪枝,这里是重要剪枝，否则TLE

            //while(i+1 < n && stick[i+1] == stick[i])
            //    i++;  //如果下一根长度跟当前的失败的长度一样，剪枝
        }
    }

    return false;
}

void solve() {
    int ans = 0;
    for(int i = stick[0]; i <= sumv; i++)
        if(sumv % i == 0) {
            memset(vis, 0, sizeof(vis));
            aim = i;
            target = sumv / aim;
            if(dfs(0, 0, 0, 0)) {
                ans = aim;
                break;
            }
        }

    cout << ans << endl;
}

int main() {
    //freopen("data.in", "r", stdin);
    while(scanf("%d", &n) == 1 && n) {
        init();
        solve();
    }
    return 0;
}