poj 1011 Sticks （DFS+剪枝）

Sticks
 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 127771 Accepted: 29926

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

2.访问过的木棍或者加上当前木棍长度后超过了目标长度，则跳过本次循环。

3.若当前木棍和上一根木棍长度相同并且上一根木棍没用到，则跳过本次循环。

4.dfs中标记开始木棍下标。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int a[66],vis[66];
int n,num,m;
bool p;
int cmp(int a,int b)
{
return a>b;
}
void dfs(int st,int cur,int cnt)
{
if(p||cnt==num)
{
p=true;
return ;
}
for(int i=st;i<n;i++)
{
if(vis[i]||cur+a[i]>m)    //访问过的木棍或者加上当前木棍长度后超过了目标长度，则跳过本次循环
continue;
if(i-1&&!vis[i-1]&&a[i]==a[i-1])    //若当前木棍和上一根木棍长度相同并且上一根木棍没用到，则跳过本次循环。
continue;
if(a[i]+cur==m)
{
vis[i]=1;
dfs(0,0,cnt+1);
vis[i]=0;
return;				//循环里后面的值都在dfs中求过了，这里直接返回上一层
}
if(a[i]+cur<m)
{
vis[i]=1;
dfs(i+1,a[i]+cur,cnt);
vis[i]=0;
if(cur==0)           //cur为0时,直接返回上一层
return ;
}
}
}
int main()
{
while(scanf("%d",&n)!=EOF&&n)
{
int sum=0;
p=false;
memset(vis,0,sizeof(vis));
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
sort(a,a+n,cmp);
for(num=n;num>=1;num--)
{
if(sum%num||a[0]>sum/num)
continue;
m=sum/num;
dfs(0,0,0);
if(p)
break;
}
printf("%d\n",m);
}
return 0;
}

poj(1011)——Sticks（经典的dfs+剪枝）

2015-07-26 17:12:49

poj 1011 Java: sticks

2016-02-02 19:47:58

POJ 1011 最小的木棒 （dfs+剪枝|| 搜索好题）

2016-03-15 00:36:24

poj 1011 Sticks

2014-02-21 17:38:26

POJ1011 Sticks【DFS+剪枝】

2016-06-12 20:50:50

poj 1011 Sticks(dfs+剪枝)

2016-05-29 10:56:08

POJ ~ 1011 ~ Sticks（DFS+剪枝）

2017-12-17 19:17:07

POJ 1011 Sticks DFS+剪枝

2013-11-14 12:19:20

poj 1011 Sticks -----dfs+剪枝

2013-12-10 08:25:03

Poj 1011-Sticks

2016-12-15 21:13:15

不良信息举报

poj 1011 Sticks （DFS+剪枝）