Lightoj 1122 数位DP

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;

int M, N;
int number[11];
int dp[11][11];

int DFS( int pos, int pre ){
if( pos > N ){
return 1;
}
if( dp[pos][pre] != -1 ){
return dp[pos][pre];
}
int ans = 0;
for( int i = 1; i <= M; i++ ){
if( abs( number[i] - pre ) <= 2 ){
ans += DFS( pos + 1, number[i] );
}
}
return dp[pos][pre] = ans;
}

int main(){
int T, Case = 1;

cin >> T;
while( T-- ){
memset( dp, -1 , sizeof( dp ) );

cin >> M >> N;
for( int i = 1; i <= M; i++ ){
cin >> number[i];
}

int ans = 0;
for( int i = 1; i <= M; i++ ){
ans += DFS( 2, number[i] );
}

cout << "Case " << Case++ << ": " << ans << endl;
}
return 0;
}