算法导论 第十五章 15-9 字符串拆分 O(n^3)

length[i][j] = length[i][j- 1] + input[j] + 1

lengthSum[i][j] = min(lengthSum[i][j], lengthSum[i][m] + save[m+ 1][j] + length[i][j])  ,(m=[i,j])

#include <iostream>
#include <algorithm>

using namespace std;

void stringParting(int *input, int size);

int main() {
	int input[] = { 1,5,1,4,4 };
	stringParting(input, 5);
}

void stringParting(int *input, int size) {		//这里我们把输入处理为全部分开后每段的长度，每一次分开会得到左半边，右半边和一个单独的字符
	int **save = new int *[size];
	int **length = new int *[size];
	for (int count = 0; count < size; ++count) {
		length[count] = new int[size];
		length[count][count] = input[count];
		save[count] = new int[size];
		save[count][count] = 0;
	}
	for (int len = 1; len < size; ++len) {
		for (int head = 0; head < size - len; ++head) {
			int tail = head + len;
			length[head][tail] = length[head][tail - 1] + input[tail] + 1;		//处理从head到tail的总长度
		}
	}
	for (int len = 1; len < size; ++len) {
		for (int head = 0; head < size - len; ++head) {
			int tail = head + len;
			save[head][tail] = INT_MAX;
			for (int middle = head; middle < tail; ++middle) {
				save[head][tail] = min(save[head][tail], save[head][middle] + save[middle + 1][tail] + length[head][tail]);
			}
		}
	}
	for (int countX = 0; countX < size; ++countX) {
		for (int countY = 0; countY < size; ++countY) {
			cout << length[countX][countY] << " ";
		}
		cout << endl;
	}
	cout << endl;
	for (int countX = 0; countX < size; ++countX) {
		for (int countY = 0; countY < size; ++countY) {
			cout << save[countX][countY] << " ";
		}
		cout << endl;
	}
}