POJ2362 Square DFS

题源：http://poj.org/problem?id=2362
题意：给你木棍的总数和每根的长度 问你能否拼成一个正方形
思路：深搜，多一个参数记录第几根，要记住刚开始的时候一根也不放，从搜索里面开始~

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<algorithm>
#define ll long long
#define inf 0x3f3f3f3f
#define MID (t[k].l+t[k].r)>>1
#define cl(a,b) memset(a,b,sizeof(a))//要多一维去记录第几根！！！ 
using namespace std;
int n,sum;
int len[21],book[21];
bool F;//最终标志
void dfs(int pos,int now,int num) { //当前搜索的点 和 当前总和
	if(F) return;
	if(num==4) {
		F=true;
		return;
	}
	for(int i=pos; i<=n; i++) {
		if(!book[i]) {
			book[i]=1;
			if(now==sum) dfs(1,len[i],num+1);
			else if(now<sum) dfs(i,now+len[i],num);
			book[i]=0;
		}
		if(F) return;
	}
}
int main() {
	int T;
	cin>>T;
	while(T--) {
		scanf("%d",&n);
		sum=0;
		int maxx=0;
		for(int i=1; i<=n; i++) {
			scanf("%d",&len[i]);
			sum+=len[i];
			if(maxx<len[i]) maxx=len[i];
			book[i]=0;
		}
		sort(len+1,len+n+1);
		if(sum%4||maxx>sum/4) { //若除以四除不尽或者有个边不行
			printf("no\n");
			continue;
		} else {
			sum/=4;
			F=false;
			dfs(1,0,1);
			if(F) printf("yes\n");
			else printf("no\n");
		}
	}
	return 0;
}

Description
Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square?
Input
The first line of input contains N, the number of test cases. Each test case begins with an integer 4 <= M <= 20, the number of sticks. M integers follow; each gives the length of a stick - an integer between 1 and 10,000.
Output
For each case, output a line containing “yes” if is is possible to form a square; otherwise output “no”.
Sample Input
3
4 1 1 1 1
5 10 20 30 40 50
8 1 7 2 6 4 4 3 5
Sample Output
yes
no
yes
Source
Waterloo local 2002.09.21