POJ 1011 Sticks （DFS + 剪枝）

Sticks

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 135947		Accepted: 31984

Description

George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had originally and how long they were originally. Please help him and design a program which computes the smallest possible original length of those sticks. All lengths expressed in units are integers greater than zero.

Input

The input contains blocks of 2 lines. The first line contains the number of sticks parts after cutting, there are at most 64 sticks. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero.

Output

The output should contains the smallest possible length of original sticks, one per line.

Sample Input

9
5 2 1 5 2 1 5 2 1
4
1 2 3 4
0

Sample Output

6
5

题意：给出n根小棒的长度a[i]，已知这n根小棒原本由若干根长度相同的长木棒（原棒）分解而来。求出原棒的最小可能长度。
 
思路：dfs+剪枝。蛮经典的题目，重点在于dfs剪枝的设计。先说先具体的实现：求出总长度sum和小棒最长的长度max1，则原棒可能的长度必在max1~sum之间，然后从小到大枚举max1~sum之间能被sum整除的长度len，用dfs求出所有的小棒能否拼凑成这个长度，如果可以，第一个len就是答案。
 
下面就是关键的了，就是这道题dfs的实现和剪枝的设计：
      1.以一个小棒为开头，用dfs看看能否把这个小棒拼凑成len长，如果可以，用vis[i]记录下用过的小棒，然后继续以另外一个小棒为开头，以此类推。
      2.小棒的长度从大到小排序，这个就不解释了。
      3.如果当前最长的小棒不能拼成len长，那么就返回前一步，更改前一步的最长小棒的组合情况（这里不能是全部退出），不用再继续搜索下去了。
      4.最重要的，就是比如说17,9,9,9,9,8,8,5,2……如果当前最长小棒为17，它与第一个9组合之后dfs发现不能拼成len，那么17就不用和后面所有的9组合了，而直接和8开始组合。这个剪枝直接从TLE到16MS，很强大。

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn = 65;
int n, a[maxn];
int vis[maxn];
int max1, sum, flag;
int len;

int cmp(int x, int y)
{
    return x > y;
}

void dfs(int dep, int now_len, int u)    // dep为当前已被用过的小棒数，u为当前要处理的小棒
{
    if (flag)
        return;
    if (now_len == 0){   //当前长度为0，寻找下一个当前最长小棒
        int k = 0;
        while (vis[k])  //寻找第一个当前最长小棒
            k++;
        vis[k] = 1;
        dfs(dep + 1, a[k], k + 1);
        vis[k] = 0;
        return;
    }
    if (now_len == len){    //当前长度为len，即又拼凑成了一根原棒
        if (dep == n)    //完成的标志：所有的n根小棒都有拼到了
            flag = 1;
        else
            dfs(dep, 0, 0);
        return;
    }
    for (int i = u; i < n; i++){
        if (!vis[i] && now_len + a[i] <= len){
            if (!vis[i - 1] && a[i] == a[i - 1])   //不重复搜索：最重要的剪枝
                continue;
            vis[i] = 1;
            dfs(dep + 1, now_len + a[i], i + 1);
            vis[i] = 0;
        }
    }
}

int main()
{
    while (cin >> n, n){
        memset(vis, 0, sizeof(vis));
        max1 = 0;
        sum = 0;
        flag = 0;
        for (int i = 0; i < n; i++){
            cin >> a[i];
            sum += a[i];
        }
        sort(a, a + n, cmp);
        for (len = a[0]; len <= sum; len++){
            if (sum % len == 0){     //枚举能被sum整除的长度
                dfs(0, 0, 0);
                if (flag)
                    break;
            }
        }
        cout << len << endl;
    }
    return 0;
}