UVA 10118 - Free Candies(记忆化搜索)

原题链接

用k[1]到k[4]表示四堆糖果的高度.用dp[k[1]][k[2]][k[3]][k[4]]表示这个高度下能够获得多少多少糖果,记忆化搜索.

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define INF 1e9
using namespace std;

int dp[45][45][45][45];
int num[5][45], vis[45], n;
int k[5];
int dfs(int cnt){
	
	if(cnt == 6)
	  return 0;
	int &ans = dp[k[1]][k[2]][k[3]][k[4]];
	if(ans != -1)
		return ans;
	ans = 0;
	for(int i = 1; i <= 4; i++){
		if(k[i] == 0)
		  continue;
	    if(vis[num[i][k[i]]]){ 
	    	vis[num[i][k[i]]] = 0;
	    	k[i]--;
	    	ans = max(ans, dfs(cnt-1)+2);
	    	k[i]++;
	    	vis[num[i][k[i]]] = 1;
	    } 
	    else{
	    	vis[num[i][k[i]]] = 1;
	    	k[i]--;
	        ans = max(ans, dfs(cnt+1));
	        k[i]++;
	        vis[num[i][k[i]]] = 0;
	     }
	} 
	return ans;
}
int main(){
	
//	freopen("in.txt", "r", stdin); 
	while(scanf("%d", &n) == 1 && n){
		
		memset(dp, -1, sizeof(dp));
		memset(vis, 0, sizeof(vis));
		for(int i = n; i >= 1; i--)
			for(int j = 1; j <= 4; j++)
			   scanf("%d", &num[j][i]);
		k[1] = k[2] = k[3] = k[4] = n;
		printf("%d\n", dfs(1)/2);
	}
	
	return 0;
}