2215.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2215 on 2006-04-26 at 12:25:15 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int DN = 10240;
const int OPPO[] = { 5, 3, 4, 1, 2, 0 };

int main()
{
	int sum[DN][7], n;
	int t, T, i, j, k;

	scanf("%d", &T);
	for(t = 0; t < T; t++) {
		memset(sum, 0, sizeof(sum));
		scanf("%d", &n);
		for(i = 1; i <= n; i++) {
			int dice[6];
			for(j = 0; j < 6; j++) scanf("%d", &dice[j]);
			for(j = 1; j <= 6; j++) {
				int pb = 0, o;
				for(o = 0; dice[o] != j; o++);
				for(k = 0; k < 6; k++)
					if(k != o && k != OPPO[o]) pb = max(pb, dice[k]);
				sum[i][dice[OPPO[o]]] = max(sum[i][dice[OPPO[o]]], sum[i-1][j]+pb);
			}
		}
		int best = 0;
		for(i = 1; i <= 6; i++)
			best = max(best, sum[n][i]);
		printf("%d\n", best);
	}
	
	return 0;
}