POJ 2362 Square G++ dfs 背

#include <iostream>
#include <cstring>
using namespace std;
//英语 抄博友程序  dfs  背 
int vis[30]; 
int da[30];
int n;
int sum;
bool dfs(int cnt,int zhi,int beg)//没第3个变量超时
{
	//cout<<cnt<<" "<<zhi<<" "<<beg<<endl;
	if(cnt==4)
	{
		return true;
	}
	for(int i=beg;i<n;i++)
	{
		if(vis[i]==0)
		{
			vis[i]=1;
			if(zhi==da[i])
			{
				if(dfs(cnt+1,sum/4,0))//第3个变量为i+1 wa
				{
					return true;
				}
			}else if(zhi>da[i])
			{
				if(dfs(cnt,zhi-da[i],i+1))
				{
					return true;
				}
			} 
			vis[i]=0;
		}
	}
	return false;
}
int main()
{
	int T;
	cin>>T;
	for(int o=0;o<T;o++)
	{
		memset(vis,0,sizeof(vis));
		cin>>n;
		int ma=-1;
		sum=0;
		for(int i=0;i<n;i++)
		{
			cin>>da[i];
			if(ma<da[i])
			{
				ma=da[i];
			}
			sum=sum+da[i];
		}
		if(sum%4!=0 || ma>(sum/4))
		{
			cout<<"no"<<endl;
			continue;
		}
		if(dfs(0,sum/4,0))
		{
			cout<<"yes"<<endl;
		}else
		{
			cout<<"no"<<endl;
		}
	}
	return 0;
}