Sticks

最新推荐文章于 2022-01-23 22:09:07 发布

冬天的一缕阳光

最新推荐文章于 2022-01-23 22:09:07 发布

阅读量751

点赞数 1

分类专栏：搜索（DFS）文章标签： Sticks nyist Sticks hdu 1455 George took sticks o

本文链接：https://blog.csdn.net/tangsl388/article/details/37755479

版权

搜索（DFS）专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Sticks

时间限制： 3000 ms | 内存限制： 65535 KB

难度： 5

描述

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.

输入

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.

输出

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

样例输入

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

样例输出

大清早写博客呀，但手痒没办法

这题的意思就是给你很多木棒，要请把木棒合并在一块。然后使得合并的木棒的长度最短，并且要求木棒的长度相同。eg：1 2 3 4 （1,4）和（2,3），这一看就是一个经典的搜索+剪枝题目。

设总长度为sum，每个的长度为l，一共的数目num=sum/l:

那么l大于最大长度从而就可以从最大长度开始搜索。遇见相同的跳过，没必要在去做了。

代码就一个回溯；

代码：

#include<iostream>
#include<fstream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<sstream>
#include<cassert>
using namespace std;
//#define LL __int64

#ifdef __int64
typedef __int64 LL;
#else
typedef long long LL;
#endif

int a[100];
int n;
int l;
int num;
bool vis[100];
int cmp(int a,int b) {
    return a>b;
}
bool dfs(int s,int le,int pos) {
    int ok;
    if(le==0) ok=0;
    else ok =1;
    if(s==num) return true;
    for(int i=pos+1; i<n; i++) {
        if(vis[i]) continue;
        if(le+a[i]==l) {
            vis[i]=1;
            if(dfs(s+1,0,-1)) return true;
            vis[i]=0;
            return false;
        }
        if(le+a[i]<l) {
            vis[i]=1;
            if(dfs(s,le+a[i],i)) return true;
            vis[i]=0;
            if(ok==0) break;
            while(a[i]==a[i+1]) i++;
        }
    }
    return false;
}

int main() {
    while(cin>>n) {
        if(n==0) break;
        int sum=0;
        for(int i=0; i<n; i++) {
            scanf("%d",&a[i]);
            sum+=a[i];
        }
        sort(a,a+n,cmp);

        for(l=a[0]; l<=sum; l++) {
            memset(vis,0,sizeof(vis));
            if(sum%l==0) {
                num=sum/l;
                if(dfs(1,0,-1)) {
                    printf("%d\n",l);
                    break;
                }
            }
        }
    }
    return 0;
}


/*

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

*/