LightOJ - 1122 Digit Count(DP)

题目大意：给你M种数，要求使用这M种数组成N位整数，使得该数的每位和相邻位的数的差不超过2

解题思路：用dp[i][m]表示组成了i位的数，最后一位是m的情况有多少种
接着得到转移dp，dp[i][m] += dp[i - 1][k] , abs(m - k) <= 2

#include <cstdio>
#include <queue>
#include <cstring>
#include <cstdlib>
using namespace std;
const int N = 12;

struct Node{
    int first, num;
    Node() {}
    Node(int first, int num): first(first), num(num) {}
};

int n, m, cas = 1;
int val[N];
int dp[N][N];
bool vis[N][N];

void init() {
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i++)
        scanf("%d", &val[i]);
}

void solve() {
    memset(dp, 0, sizeof(dp));
    memset(vis, 0, sizeof(vis));
    queue<Node> Q;
    for (int i = 0; i < n; i++) {
        dp[i][1] = 1;
        Q.push(Node(i, 1));
        vis[i][1] = true;
    }

    while (!Q.empty()) {
        int first = Q.front().first;
        int num = Q.front().num;
        Q.pop();
        if (num == m) continue;
        for (int i = 0; i < n; i++) {
            if (abs(val[first] - val[i]) <= 2) {
                dp[i][num + 1] += dp[first][num];
                if (!vis[i][num + 1]) {
                    Q.push(Node(i, num + 1));
                    vis[i][num + 1] = true;
                }
            }
        }
        vis[first][num] = false;
    }
    int ans = 0;
    for (int i = 0; i < n; i++)
        ans += dp[i][m];
    printf("Case %d: %d\n", cas++, ans);
}

int main() {
    int test;
    scanf("%d", &test);
    while (test--) {
        init();
        solve();
    }
    return 0;
}