这是我的程序：
#include <iostream.h>
int a[1000], b[1000];
int flag;
int length, n, sticks;
void search(int num, int now, int next);
void solve(int num)
{
	if (num==sticks) {flag = 1; cout<<length<<endl; return;}
	int i;
	for (i=1; i<=n; i++) if (!b[i]) break;
	b[i] = 1;
	search(num, a[i], i);
	b[i] = 0;
}

void search(int num, int now, int next)
{
	if (flag == 1) return;
	if (now == length) { solve(num+1); return;}
	if (next+1 > n) return;
	int i;
	for (i=next+1; i<=n; i++)
		if (!b[i] && (now+a[i]<=length))
		{	
			b[i] = 1; 
			search(num, now+a[i], i);
			b[i] = 0;
			if (flag == 1) return;
			if (now+a[i]==length) return;		
		}
}

void main()
{
	flag = 0;	
	a[0] = 0;
	cin>>n;	
	while (n!=0)
	{
		int total=0;
		for (int i=1; i<=n; i++)
		{
			cin>>a[i];
			b[i] = 0;
			total += a[i];
			int temp=a[i], j=i;
			while (temp<a[j-1]) {a[j] = a[j-1]; j--;}
			a[j] = temp;
		}		
		length = a[n];	
		for (length=a[n]; length<=total; length++)
		{
			if (total%length==0 && !flag)
			{
				sticks = total / length;
				solve(1);
			}							
		}
		flag = 0;
		cin>>n;
	}
}

• 搜索题，讲究的就是搜索顺序，剪枝等技巧 (13) hawk 2004-02-22 11:37:33
  • Re:搜索题，讲究的就是搜索顺序，剪枝等技巧 (1210) wangcheng711 2004-02-22 14:49:40