专题链接:https://codeforces.com/group/5yyKg9gx7m/contest/269717/problem/C
思路
因为题目直接给出的改键时间不一定是最短的,先跑一遍floyd,找出一个字母改成其他字母的最小时间。再构造一个前缀表,方便我们计算批量改键的时间,最后dp即可求出答案。
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>
#include<cstring>
#include<climits>
#include<vector>
#include<queue>
#include<stack>
#define lowbit(i) ((i)&(-(i)))
#define ll long long
using namespace std;
int cost[27][27];
int sum[100001][27];//前缀表
int N,M,K;
char str[100001];
int dp[27];//代表结尾为i的改键方案的花费时间
int ans[100001];//代表改前i个键的最小时间
int main()
{
cin >> N >> M >> K;
scanf("%s", str + 1);
for (int i = 1; i <= M; i++)
{
for (int j = 1; j <= M; j++)
scanf("%d", &cost[i][j]);//代表把i改成j的时间
}
for (int k = 1; k <= M; k++)//floyd
{
for (int i = 1; i <= M; i++)
{
for (int j = 1; j <= M; j++)
cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
}
}
for (int i = 1; i <= N; i++)//前缀表
{
for (int j = 1; j <= M; j++)
sum[i][j] = sum[i - 1][j] + cost[str[i] - 'a' + 1][j];
}
memset(dp, 0x3f, sizeof(dp));//初始化
memset(ans, 0x3f, sizeof(ans)); ans[0] = 0;//初始化
for (int i = K; i <= N; i++)
{
for (int j = 1; j <=M; j++)
{
dp[j] = min(dp[j] + cost[str[i] - 'a' + 1][j], ans[i - K] + sum[i][j] - sum[i-K][j]);//无非就两种情况,接着上次的字母改或是重新选择一个字母改k次
ans[i] = min(ans[i], dp[j]);//更新最优解
}
}
printf("%d\n", ans[N]);
return 0;
}