Power Calculus UVA - 1374 迭代加深搜索

迭代加深搜索经典题目，好久不做迭代加深搜索题目，拿来复习了，我们直接对当前深度进行搜索，注意剪枝，还有数组要适当开大，因为2^maxd可能很大

题目：题目链接

AC代码：

 #include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <cmath>
 #include <algorithm>
 #include <cstring>
 #include <vector>
 #include <string>
 #include <queue>
 #include <map>
 #include <set>

 #define FRER() freopen("in.txt", "r", stdin);
 #define INF 0x3f3f3f3f

 using namespace std;

 const int maxn =  + ;

 int num[maxn], vis[maxn], temp[], maxd, n;

 bool dfs(int, int);

 int main()
 {
     //FRER()
     ios::sync_with_stdio();
     cin.tie();

     temp[] = ;
     for(int i = ; i < ; ++ i)
         temp[i] = temp[i - ] << ;
     while(cin >> n && n) {
         memset(vis, , sizeof(vis));
         for(maxd = ; ; ++maxd)
             if(dfs(, )) break;
         cout << maxd << endl;
     }
     return ;
 }

 bool dfs(int cur, int s) {
     if(cur == maxd && s == n) return true;
     if(cur > maxd) return false;
     if(s * temp[maxd - cur] < n) return false;
     num[cur] = s;
     vis[s] = ;
     for(int i = ; i <= cur; ++i) {
         int u = num[i] + s;
         if(!vis[u]) {
             vis[u] = ;
             if(dfs(cur + , u)) return true;
             vis[u] = ;
         }
         u = abs(num[i] - s);
         if(!vis[u]) {
             vis[u] = ;
             if(dfs(cur + , u)) return true;
             vis[u] = ;
         }
     }
     vis[s] = ;
     return false;
 }