TOJ 1398.Square(DFS+减枝经典题目)

题目链接 : http://acm.tju.edu.cn/toj/showp1398.html

Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square?
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.

For each case, output a line containing “yes” if is is possible to form a square; otherwise output “no”.
······

这个题真的很不错，首先很难想到可已使用搜索的算法來解，其次，在搜索时还有一些减枝的技巧需要掌握，例如在dfs之前排除一些情况，随后，在dfs时，由于正方形的特性，因此只要找到三边就可以了（前提是在dfs前已经排除了无法够成正方形的情况）。

#include <iostream>
#include <stdio.h>
#include <cstring>
#include <algorithm>
using namespace std;
int a[25];
bool flag[25];
int sum,l,n;

int dfs(int pos,int len,int count)
{
    if(count==3){
        return 1;
    }
    int i;
    for(i=pos;i>=0;i--){
        if(!flag[i]){
            flag[i]=true;
            if(len+a[i]<l){
                if(dfs(i-1,len+a[i],count)){
                    return 1;
                } 
            }
            else if (len + a[i] == l){
                if(dfs(n-1,0,count+1))
                    return 1;
            }
            flag[i]=false;
        }
    }
    return 0;
}

int main(){
    int tmp;
    scanf("%d",&tmp);
    while(tmp--){
        sum=0;
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            sum+=a[i];
        }
        l=sum/4;
        memset(flag,0,sizeof(flag));
        sort(a,a+n);
        if(l*4 != sum || n<4 || l<a[n - 1]){
            printf("no\n");
            continue;
        }
        if(dfs(n-1,0,0))
            printf("yes\n");
        else
            printf("no\n");
    }
}