ZOJ 2852 Deck of Cards(DP)

按要求把牌一次放入

#include<iostream>
#include<cstdio>
#include<set>
#include<string>
#include<string.h>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<algorithm>
#include<sstream>
#include<utility>
#include<cmath>
#include<functional>
#include<ctime>
#define mt(a) memset(a,0,sizeof (a))
#define fl(a,b,c) fill(a,b,c)
#define SWAP(a,b,t) (t=a,a=b,b=t)

#define inf 1000000000+7
#define sp system("pause")

using namespace std;
typedef long long ll;

int dp[120][32][32][32];
map<char, int>ma;

void init()
{
	ma['A'] = 1;
	ma['2'] = 2;
	ma['3'] = 3;
	ma['4'] = 4;
	ma['5'] = 5;
	ma['6'] = 6;
	ma['7'] = 7;
	ma['8'] = 8;
	ma['9'] = 9;
	ma['T'] = 10;
	ma['J'] = 10;
	ma['Q'] = 10;
	ma['K'] = 10;
}

int main()
{
	int n;
	init();
	while (cin >> n, n)
	{
		for (int i = 0; i < 120; i++)
		{
			for (int j = 0; j < 32; j++)
			{
				for (int k = 0; k < 32; k++)
				{
					for (int l = 0; l < 32; l++)
						dp[i][j][k][l] = -1;
				}
			}
		}
		string str;
		for (int i = 0; i < n; i++)
		{
			cin >> str;
			if (i == 0)
			{
				if (str[0] == 'F')
					dp[1][0][0][0] = 350;
				else
				{
					int te = ma[str[0]];
					dp[1][te][0][0] = 50;
					dp[1][0][te][0] = 50;
					dp[1][0][0][te] = 50;
				}
				continue;
			}
			for (int j = 0; j < 32; j++)
			{
				for (int k = 0; k < 32; k++)
				{
					for (int l = 0; l < 32; l++)
					{
						if (j>21 && k>21 && l>21) dp[i + 1][j][k][l] = max(dp[i][j][k][l], dp[i + 1][j][k][l]);
						if (dp[i][j][k][l] == -1)continue;
						if (str[0] == 'F')
						{
							if (j<21)
							dp[i + 1][0][k][l] = max(dp[i + 1][0][k][l], dp[i][j][k][l] + 150);
							if (k<21)
							dp[i + 1][j][0][l] = max(dp[i + 1][j][0][l], dp[i][j][k][l] + 250);
							if (l<21)
							dp[i + 1][j][k][0] = max(dp[i + 1][j][k][0], dp[i][j][k][l] + 350);
						}
						else
						{
							int te = ma[str[0]];
							if (te + j == 21)	dp[i + 1][0][k][l] = max(dp[i + 1][0][k][l], dp[i][j][k][l] + 150);
							else if (j < 21)dp[i + 1][j + te][k][l] = max(dp[i + 1][j + te][k][l], dp[i][j][k][l] + 50);
							if (te + k == 21)dp[i + 1][j][0][l] = max(dp[i + 1][j][0][l], dp[i][j][k][l] + 250);
							else if (k < 21)dp[i + 1][j][k + te][l] = max(dp[i + 1][j][k + te][l], dp[i][j][k][l] + 50);
							if (te + l == 21)dp[i + 1][j][k][0] = max(dp[i + 1][j][k][0], dp[i][j][k][l] + 350);
							else if (l < 21)dp[i + 1][j][k][l + te] = max(dp[i + 1][j][k][l + te], dp[i][j][k][l] + 50);
						}

					}
				}
			}
		}
		int maxx = 0;
		for (int i = 0; i < 32; i++)
		{
			for (int j = 0; j < 32; j++)
			{
				for (int k = 0; k < 32; k++)
				{
					maxx = max(maxx, dp[n][i][j][k]);
				}
			}
		}
		cout << maxx << endl;
	}
	//sp;
	return 0;
}