UVa:10364 Square

这个题是上个题的简化版，有了之前那些剪枝，速度会非常快。

 

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define MAXN 25
#define MOD 1000000007
#define INF 2139062143
#define ll double
#define eps 1e-8
using namespace std;
int stick[MAXN],side,n;
bool use[MAXN];
bool dfs(int cur,int sum,int k)
{
    if(cur==3) return true;
    for(int i=k; i<n; ++i)
    {
        if(use[i]||i>0&&!use[i-1]&&stick[i-1]==stick[i]) continue;
        use[i]=true;
        if(sum+stick[i]==side)
        {
            if(dfs(cur+1,0,0)) return true;
            use[i]=false;
            return false;
        }
        else if(sum+stick[i]<side)
        {
            if(dfs(cur,sum+stick[i],i+1))
                return true;
        }
        use[i]=false;
        if(sum==0)  return false;
    }
    return false;
}
bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int sum=0;
        scanf("%d",&n);
        int maxn=0;
        for(int i=0; i<n; ++i)
        {
            scanf("%d",&stick[i]);
            sum+=stick[i];
            maxn=max(stick[i],maxn);
        }
        if(sum%4)
        {
            puts("no");
            continue;
        }
        else side=sum/4;
        if(maxn>side)
        {
            puts("no");
            continue;
        }
        sort(stick,stick+n,cmp);
        memset(use,0,sizeof(use));
        if(dfs(0,0,0)) puts("yes");
        else puts("no");
    }
    return 0;
}