C++-POJ1020-Anniversary Cake[搜索][dfs]

 #include <set>
 #include <map>
 #include <cmath>
 #include <queue>
 #include <vector>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 using namespace std;
 int t,s,n,a,sum,row[],cake[];
 void init(){memset(row,,sizeof(row)),memset(cake,,sizeof(cake)),sum=;}
 int find(){int p;for(int i=,min=;i<=s;i++)if(min>row[i])min=row[i],p=i;return p;}
 int count(int p){int cnt=;for(int i=p;i<=s;i++)if(row[i]==row[p])cnt++;else break;return cnt;}
 void put(int p,int x){cake[x]--;for(int i=p;i<=p+x-;i++)row[i]+=x;}
 void del(int p,int x){cake[x]++;for(int i=p;i<=p+x-;i++)row[i]-=x;}
 bool dfs(int dep) {
     if(dep==n)return true;int p=find();
     for(int x=;x;x--)if(cake[x]&&row[p]+x<=s&&count(p)>=x){put(p,x);if(dfs(dep+))return true;del(p,x);}
     return false;
 }
 int main() {
     for (scanf("%d",&t);t--;) {
         init(),scanf("%d%d",&s,&n);
         for(int i=;i<=n;i++)scanf("%d",&a),cake[a]++,sum+=a*a;
         puts((sum==s*s?dfs():)?"KHOOOOB!":"HUTUTU!");
     }
     return ;
 }