动态规划k乘积问题(2)

int main(void) { int n,k,i,j; int a[MAXN]={0},la=0; char c ; scanf(\ //input n, k while ( ( c=getchar() )!='#'){ //read integer a[++la] = c-'0' ; } for(i=1 ; i<= n; i++){ w[i][i]= a[i] ; for(j=i+1 ; j<= n; j++) w[i][j] = w[i][j-1]*10 + a[j] ; } for(i=1;i<=n;i++){ for(j=1;j<=n;j++){ printf(\ } printf(\ } maxdp(n,k,a) ; printf(\ print_foot(a, n, k); return 0; }