题目地址:http://acm.nyist.net/JudgeOnline/problem.php?pid=746
思路:参考别人A的,和m段字段和有点类似
AC代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long LL;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
LL dp[25][25];
char a[25];
LL b[25][25];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int m;
scanf("%s%d",a+1,&m);
int len = strlen(a+1);
for(int i=1; i<=len ;i++)
{
for(int j=i; j<=len; j++)
{
LL sum = 0;
for(int k=i; k<=j; k++)
{
sum = sum * 10 + (a[k] - '0');
}
b[i][j] = sum;
}
}
memset(dp,0,sizeof(dp));
for(int i=1; i<=len; i++)
dp[i][1] = b[1][i];
for(int i=1; i<=m; i++)
{
for(int j=i; j<=len; j++)
{
for(int k=1; k<j; k++)
{
dp[j][i] = max(dp[k][i-1]*b[k+1][j],dp[j][i]);
}
}
}
printf("%lld\n",dp[len][m]);
}
return 0;
}