poj1011 Sticks(搜索剪枝)

最新推荐文章于 2024-07-15 17:08:53 发布

刑风

最新推荐文章于 2024-07-15 17:08:53 发布

阅读量394

点赞数

分类专栏： ACM笔记文章标签： poj 测试搜索

本文链接：https://blog.csdn.net/ywhjames/article/details/42190807

版权

ACM笔记专栏收录该内容

2 篇文章 0 订阅

订阅专栏

被这题虐了千百遍后终于将其干掉！

Sticks

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 123238		Accepted: 28607

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

Source

Central Europe 1995

此题无法用贪心算法解决，因为贪心找不到全局最优解。贪心算法请测试下面用例：

input：
27
15 3 2 4 11 1 8 8 8 15 3 2 4 11 1 8 8 8 15 3 2 4 11 1 8 8 8

output：
20

正确组合为（15 3 2）（8 8 4）（11 8 1）
但采用贪心排序的话会先选取（11 3 3 3）或是（15,4,...）这样的话认为20过不了。

另外本题对剪枝效率要求极高，看看时限然后测试下面BT用例，

input：
64
40 40 30 35 35 26 15 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 43 42 42 41 10 4 40 40 40 40 40 
40 40 40 40 40 40 40 40 40 25 39 46 40 10 4 40 40 37 18 17 16 15 40 40 40 40 40 40 40 40

output：
454

//答案:
第1 of 5根木棍：
46+43+42+42+41+40+40+40+40+40+40=454
第2 of 5根木棍：
40+40+40+40+40+40+40+40+40+40+40+10+4=454
第3 of 5根木棍：
40+40+40+40+40+40+40+40+40+40+40+10+4=454
第4 of 5根木棍：
40+40+40+40+40+40+40+40+40+40+39+15=454
第5 of 5根木棍：
40+40+40+40+40+37+35+35+30+26+25+18+17+16+15=454

#include<stdio.h>
#include<algorithm>

using namespace std;

int prime[16]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,51};

struct stick
{
    int len;//木棒长
    int num;//剩余木棒个数
};
bool cmpn(struct stick a,struct stick b)
{
    return a.num>b.num;
}
bool cmpl(struct stick a,struct stick b)
{
    return a.len>b.len;
}

struct stick sticks1[51],sticks[51];

bool dfs(int limit,int value,int leave,int num,int start)
{
    int i;
    if(leave==0)//匹配完一个木棒
    {
        if(num<=2)//全部木棒匹配，最后一个木棒自动匹配
            return true;
        else
            return dfs(limit,value,value,num-1,0);
    }
    if(sticks[limit-1].len>leave)
        return false;
    for(i=start;i<limit;i++)//从大到小进行选择
    {
        if(sticks[i].num>0)
        {
            if(sticks[i].len<=leave)
            {
                sticks[i].num--;
                if(dfs(limit,value,leave-sticks[i].len,num,i))
                    return true;
                sticks[i].num++;
                if(sticks[i].len==leave)//存在恰好匹配木棒则必选，否则才考虑更小的木棒
                    return false;
            }
            if(leave==value)//第一个木棒必选最长的
                return false;
        }
    }
    return false;
}

int main()
{
    int i,j,k,limit,t;
    int sum,num1;
    while(1)
    {
        scanf("%d",&num1);
        if(num1==0)
            break;
        sum=0;
        for(i=0;i<=50;i++)
        {
            sticks1[i].len=i;
            sticks1[i].num=0;
        }
        for(i=0;i<num1;i++)
        {
            scanf("%d",&j);
            sticks1[j].num++;
            sum+=j;
        }
        sort(sticks1,sticks1+51,cmpn);//按数量排序
        for(i=0;i<=51;i++)
            if(sticks1[i].num==0)
                break;
        limit=i;//木棒的种类
        sort(sticks1,sticks1+limit,cmpl);//按长度排序
        for(i=num1;i>1;i--)//原有i个木棍
        {
            if(sum%i!=0)//小棍长度不为整数
                continue;
            if(sum/i<sticks1[0].len)//长度无法容纳最长小棍
                continue;
            t=i;
            for(j=0;j<limit;j++)//提取木棒数据
                sticks[j]=sticks1[j];
            //这部分貌似用处不大
            for(k=1;prime[k]<=t;k++)
            {
                if(t%prime[k]!=0)
                    continue;
                for(j=0;j<limit;j++)
                    if(sticks[j].num%prime[k]!=0)
                        break;
                if(j==limit)//以公因子寻找同等类
                {
                    for(j=0;j<limit;j++)
                        sticks[j].num/=prime[k];
                    t/=prime[k];
                    k--;
                }
            }
            if(t==1)
                break;
            if(dfs(limit,sum/i,sum/i,t,0))//匹配成功
                break;
        }
        printf("%d\n",sum/i);
    }
    return 0;
}