DNA sequence HDU - 1560 IDA*

迭代加深搜索，每次限制一个深度，搜不到就+1.
剪枝: 当剩余的深度不够最小匹配次数时直接退出。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <cmath>

using namespace std;

int n, m;
int a[10][10], len[10];
char p[] = {'A', 'T', 'G', 'C'};

int geth(int x[])
{
    int cnt[4] = {0};
    for (int i = 1; i <= n; i++)
    {
        int sum[4] = {0};
        for (int j = x[i]; j < len[i]; j++)
            sum[a[i][j]]++;
        for (int j = 0; j < 4; j++)
            cnt[j] = max(cnt[j], sum[j]);
    }

    return cnt[0] + cnt[1] + cnt[2] + cnt[3];
}

bool ID_Astar(int d, int x[])
{
    if (geth(x) > d)
        return false;
    if (!d)
        return true;
    int tmp[10] = {0};
    for (int i = 0; i < 4; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (x[j] < len[j] && a[j][x[j]] == i)
                tmp[j] = x[j] + 1;
            else
                tmp[j] = x[j];
        }
        if (ID_Astar(d - 1, tmp))
            return true;
    }

    return false;
}

int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d", &n);
        for (int i = 1; i <= n; i++)
        {
            char s[10];
            scanf("%s", s);
            len[i] = strlen(s);
            for (int j = 0; j < len[i]; j++)
                for (int k = 0; k < 4; k++)
                    if (p[k] == s[j])
                        a[i][j] = k;
        }
        int start[10] = {0}, deep = 1;
        while (!ID_Astar(deep, start))
            deep++;
        printf("%d\n", deep);
    }

    return 0;
}