2091.cpp

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

/*  This Code is Submitted by wywcgs for Problem 2091 on 2006-03-02 at 09:57:46 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int MAX = 16;

int main()
{
	int i, b, w, ability[MAX][MAX];
	char line[128], ch;
	
	while((ch = getchar()) != EOF) {
		ungetc(ch, stdin); memset(ability, 0, sizeof(ability));
		for(i = 1; gets(line) != NULL && line[0] != '*'; i++) {
			if(line[0] == 0) { i--; continue; }
			int lmt = min(15, i), bstr, wstr; sscanf(line, "%d %d", &bstr, &wstr);
			for(b = lmt; b >= 0; b--)
				for(w = lmt; w >= 0; w--)
					if(b == 0 && w == 0) continue;
					else if(b == 0) ability[b][w] = max(ability[b][w], ability[b][w-1]+wstr);
					else if(w == 0) ability[b][w] = max(ability[b][w], ability[b-1][w]+bstr);
					else ability[b][w] = max(ability[b][w], max(ability[b-1][w]+bstr, ability[b][w-1]+wstr));
		}
		printf("%d\n", ability[15][15]);
	}
	
	return 0;
}