HDU-1455 Sticks 经典dfs剪枝

http://acm.hdu.edu.cn/showproblem.php?pid=1455

题意：

原先有任意段棍子 被人任意切成n段 后来想还原 但又不知道原先的段数与长度 

问原先每根棍子的最短可能长度

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
const int maxn = 75;
const int inf = 1<<30;
int n,pos,ans,flag;
int len[maxn];
bool vis[maxn];
bool cmp( int a,int b )
{
return a > b;
}
void DFS( int L,int tot,int k)
{
if( flag ) return;
if ( tot == pos )
{
flag = 1;
return;
}
int pre = 0;
for( int i = k; i <= n; i ++ )
{
if( !vis[i] && pre != len[i] && L + len[i] <= ans )
{
pre = len[i];
vis[i] = true;
if( L + len[i] == ans )
DFS( 0,tot+1,1 );
else
DFS( L+len[i],tot,i+1 );
vis[i] = false;
if( flag || !L )            //找到答案或避免出现搜索123与321的重复现象
return;
}
}
}


int main()
{
//freopen("data.txt","r",stdin);
int Sum,maxs;
while ( scanf("%d",&n) != EOF,n )
{
Sum = maxs = 0;
for( int i = 1; i <= n; i ++ )
{
scanf("%d",&len[i]);
Sum += len[i];
}
sort( len+1,len+n+1,cmp );
for( int i = len[1]; i <= Sum; i ++ )     
{
if( Sum%i == 0 )    
{
flag = 0;
memset( vis,0,sizeof(vis) );
pos = Sum/i; ans = i;        //pos为段数 ans为每段长度
DFS( 0,0,1 );
if( flag )
break;
}
}
printf("%d\n",ans);
}
return 0;
}