题意
对长度为n的木板涂色,每次涂色会覆盖之前涂过的区域,给出涂色目标木板,求出最少的涂色次数。
思路
设f[i][j]为涂好了i~j的最少次数,那么:
f[i][j]=min{f[i][j-1],f[i+1][j]} (col[i]==col[j]),即一开始可以从i~j-1或i+1~j多涂一格
f[i][j]=min{f[i][k]+f[k+1][j]},即分成两部分涂色
代码
#include <cstdio>
#include <cstring>
#include <algorithm>
int n;
int f[51][51];
char s[51];
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
memset(f, 127 / 3, sizeof(f));
for (int i = 1; i <= n; i++)
f[i][i] = 1;
for (int i = n; i >= 1; i--)
for (int j = i + 1; j <= n; j++)
if (s[i] == s[j])
f[i][j] = std::min(f[i + 1][j], f[i][j - 1]);
else {
for (int k = i; k < j; k++)
f[i][j] = std::min(f[i][j], f[i][k] + f[k + 1][j]);
}
printf("%d", f[1][n]);
}