【DP】数字旋转 校OJ2445

#include <bits/stdc++.h>
using namespace std;

int n, m;
char ch[105][15];
int len[105];
int a[15], b[15];
long long dp[105][1010];

int jiaohuan(int t, int k) //ch[t]换k次
{
	for (int i = 0; i < len[t]; i++) //字符转数字
		b[i] = ch[t][i] - '0';

	for (int i = 0; i < len[t]; i++) //转k次
	{
		a[i] = b[(i + k) % len[t]];
	}

	int sum = 0;
	int q = 1;
	for (int i = len[t] - 1; i >= 0; i--) //计算转后数值
	{
		sum += a[i] * q;
		q *= 10;
	}

	return sum;
}

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
	{
		scanf("%s", ch[i]);
		len[i] = strlen(ch[i]);
	}

	for (int i = 1; i <= n; i++) //前i个
	{
		for (int j = 0; j <= m; j++) //转j次
		{
			for (int k = 0; k < min(len[i], j + 1); k++) //第i个转k次
			{
				dp[i][j] = max(dp[i][j], dp[i - 1][j - k] + jiaohuan(i, k));
			}
		}
	}

	printf("%lld\n", dp[n][m]);

	return 0;
}