用一个四维数组记录状态dp[a][b][c][d]表示分别从1,2,3,4堆糖果取出a,b,c,d个时能获得多少对糖果。当从某一堆取出一个糖果时,当取出的这个糖果与篮子糖果颜色相同时有dp[a+1][b][c][d]=dp[a][b][c][d]+1, 不相同时dp[a+1][b][c][d]=dp[a][b][c][d].
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <string>
#include <string.h>
#include <cmath>
#include <sstream>
using namespace std;
const int maxn = 50;
int dp[maxn][maxn][maxn][maxn];
int pile[maxn][4], p[6];
int n;
int dfs(int num, int status)
{
int &ans = dp[p[0]][p[1]][p[2]][p[3]];
if (ans != -1)
return ans;
if (num == 5)
return 0;
ans = 0;
for (int i = 0; i < 4; i++)
{
if (p[i] < n)
{
int st = 1 << pile[p[i]][i];
p[i]++;
if (status&st)
ans = max(ans, dfs(num - 1, status^st) + 1);
else
ans = max(ans, dfs(num + 1, status^st));
p[i]--;
}
}
return ans;
}
int main()
{
while (cin >> n&&n!=0)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < 4; j++)
{
cin >> pile[i][j];
}
}
memset(dp, -1, sizeof(dp));
memset(p, 0, sizeof(p));
cout << dfs(0, 0) << endl;;
}
}