思路
定义
d
p
[
i
]
[
j
]
[
a
]
[
b
]
dp[i][j][a][b]
dp[i][j][a][b]:已经用了
i
i
i个黑棋,
j
j
j个白棋,且以当前放置的棋子颜色来算,黑棋连续a个,白棋连续b个的方案数(当前若为黑那么白棋连续为0)
分析可得
d
p
[
i
+
1
]
[
j
]
[
k
+
1
]
[
0
]
dp[i + 1][j][k + 1][0]
dp[i+1][j][k+1][0]可由
d
p
[
i
+
1
]
[
j
]
[
k
+
1
]
[
0
]
+
d
p
[
i
]
[
j
]
[
k
]
[
u
]
dp[i + 1][j][k + 1][0]+dp[i][j][k][u]
dp[i+1][j][k+1][0]+dp[i][j][k][u]转移过来,同理可得出另外一个。
本题解用来提醒本人,讲解请点这里:讲解
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 10, mod = 1e8;
int dp[N][N][11][11];
int n1, n2, k1, k2;
int main()
{
cin >> n1 >> n2 >> k1 >> k2;
dp[0][0][0][0] = 1;
for (int i = 0; i <= n1; i ++ )
for (int j = 0; j <= n2; j ++ )
for (int k = 0; k <= k1; k ++ )
for (int u = 0; u <= k2; u ++ )
{
if (k && u) continue;
int v = dp[i][j][k][u];
if (i + 1 <= n1 && k + 1 <= k1) dp[i + 1][j][k + 1][0] = (dp[i + 1][j][k + 1][0] + v) % mod;
if (j + 1 <= n2 && u + 1 <= k2) dp[i][j + 1][0][u + 1] = (dp[i][j + 1][0][u + 1] + v) % mod;
}
int res = 0;
for (int i = 0; i <= k1; i ++ )
for (int j = 0; j <= k2; j ++ )
res = (res + dp[n1][n2][i][j]) % mod;
cout << res << '\n';
return 0;
}
总结:
dp问题遇见的太少了,经验不足,这道题目我连状态都很难表示出来。多做一些动态规划的题目。