NOIP2000乘积最大

其实……数据完全没有40那么多= =最多10

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<bitset>
#define LL long long
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define down(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
#define N 45
#define M 10
LL f[N][M];
int a[N];
int n,m;
LL ans=0;

void ini()
{
	memset(f,0,sizeof(f));
	scanf("%d %d\n",&n,&m);
	fo(i,1,n)
	{
		char s=getchar();
		a[i]=s-'0';
		f[i][0]=f[i-1][0]*10+a[i];
	}
}

LL calc(int be,int en)
{
	LL ret=0;
	fo(i,be+1,en)
	if(ret==0)ret=a[i];else ret=ret*10+a[i];
	return ret;
}

void DP()
{
	fo(j,1,m)
	fo(i,1,n)
	{
		fo(k,1,i-1)
		{
			LL t=calc(k,i);
//			if(i==n&&k==2)cout<<t<<' '<<f[k][j-1]<<' '<<f[i][j]<<endl;
			f[i][j]=max(f[i][j],f[k][j-1]*t);
		}
	}
}

void OUT()
{
	ans=f[n][m];
	cout<<ans<<endl;
}

int main()
{
	ini();
	DP();
	OUT();
	return 0;
}