poj 1579 动态规划备忘录

DP备忘录的应用，很简单。

//============================================================================
//
// >     File        :    poj1579.cpp
// >     Author      :    flowertree
// >     Time        :    2015年11月14日
// >     Algorithm   :    递归三目表达式 记忆化搜索 DP备忘录
//
//============================================================================

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>
using namespace std;

#define MAX 21

int map[MAX][MAX][MAX];

int f(int a, int b, int c)
{
	if(a <= 0 || b <= 0 || c <= 0)
		return 1;
	if(a > 20 || b > 20 || c > 20)
		return 1048576;
	if(map[a][b][c] != 0)
		return map[a][b][c];
	if(a < b && b < c)
	{
		return map[a][b][c] = f(a, b, c - 1) + f(a, b - 1, c - 1) - f(a, b - 1, c);
	}
	return map[a][b][c] = f(a - 1, b, c) + f(a - 1, b - 1, c) + f(a - 1, b, c - 1) - f(a - 1, b - 1, c - 1);
}

int main()
{
	memset(map, 0, sizeof(map));
	int a, b, c;
	int sum;
	while(cin >> a >> b >> c, a != -1 || b != -1 || c != -1)
	{
		sum = f(a, b, c);
		printf("w(%d, %d, %d) = %d\n", a, b, c, sum);
	}
	system("pause");
	return 0;
}