北大 方盒游戏

北大 方盒游戏 练习代码

#include<iostream> 
using namespace std;

struct Block {
	int color;
	int len;
};
struct Block segment[200];
int score[200][200][200];//保存计算中间结果
int click_box(int start, int end, int extra_len) {
	int i, result, temp;
	if (score[start][end][extra_len] > 0)//有计算过的值,直接用
		return score[start][end][extra_len];
	result = segment[end].len + extra_len;//开始直接消除的方式 
	result = result * result;
	if (start == end) {//迭代结束的条件
		score[start][end][extra_len] = result;
		return score[start][end][extra_len];
	}
	result += click_box(start, end - 1, 0);
	for (i = end - 1; i >= start; i--) {//开始和左边i块合并的循环
		if (segment[i].color != segment[end].color)
			continue;
		temp = click_box(start, i, segment[end].len + extra_len) + click_box(i + 1, end - 1, 0);
		if (temp <= result) continue;
		result = temp;
	}
	score[start][end][extra_len] = result;
	return score[start][end][extra_len];
}

int main() {
	int t, n, i, j, end, color;
	cin >> t;//输入组数
	for (i = 0; i < t; i++) {
		cin >> n;//方块数
		end = 0;
		cin >> segment[end].color;
		segment[end].len = 1;
		for (j = 1; j < n; j++) {
			cin >> color;
			if (color == segment[end].color) segment[end].len++;
			else {
				end++;
				segment[end].color = color;
				segment[end].len = 1;
			}
		}
		memset(score, 0, sizeof(score));
		cout << "Case " << i + 1 << ": " << click_box(0, end, 0) << endl;
	}
	
	return 0;
}