746-整数划分（四）

http://nyoj.top/status

题意：给n,m;问n中插入m-1个乘号最大多少；

思路：dp[i][j]表示1-i位置插入j个乘号最大值；转移方程：dp[i][j]=max(dp[i][j],dp[k][j-1]*num[k+1][i])（1=k<i）;num[i][j]表示区间i-j的数值；

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll dp[22][22];
ll num[22][22];
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int t;
    sfi(t);
    while(t--)
    {
        char s[22];
        sfs(s+1);
        int m;
        sfi(m);
        mem(dp,0);
        mem(num,0);
        int n=strlen(s+1);
        for(int i=1;i<=n;i++)
        {
            for(int j=i;j<=n;j++)
            {
                for(int k=i;k<=j;k++)
                {
                    num[i][j]*=10;
                    num[i][j]+=s[k]-'0';
                }
            }
            dp[i][0]=num[1][i];
        }
        for(int j=1;j<m;j++)
        {
            for(int i=1;i<=n;i++)
            {
                for(int k=1;k<i;k++)
                {
                    dp[i][j]=max(dp[i][j],dp[k][j-1]*num[k+1][i]);
                }
            }
        }
        printf("%lld\n",dp[n][m-1]);
    }
    return 0;
}