洛谷P1464记忆性搜索

先上自己理解的不三不四的代码
`#include
#include
#include
using namespace std;

long long int ans[21][21][21] = { 0 };

long long int w(int a, int b, int c)
{
if (a <= 0 || b <= 0 || c <= 0)
{
return 1;
}
else if (a > 20 || b > 20 || c > 20)
{
return w(20, 20, 20);
}
else
{
return ans[a][b][c];
}
}

int main()
{
for (int i = 0; i <= 20; i++)
{
for (int j = 0; j <= 20; j++)
{
for (int k = 0; k <= 20; k++)
{
ans[i][j][k] = 1;
}
}
}
for (int i = 1; i <= 20; i++)
{
for (int j = 1; j <= 20; j++)
{
for (int k = 1; k <= 20; k++)
{
if (i < j && j < k)
{
ans[i][j][k] = ans[i][j][k - 1] + ans[i][j - 1][k - 1] - ans[i][j - 1][k];
}
else
{
ans[i][j][k] = ans[i - 1][j][k] + ans[i - 1][j - 1][k] + ans[i - 1][j][k - 1] - ans[i - 1][j - 1][k - 1];
}
}
}
}
long long int a, b, c;
while(cin >> a >> b >> c && (a != -1 || b != -1 || c != -1))
{
printf(“w(%lld, %lld, %lld) = %d\n”, a, b, c, w(a, b, c));
}
return 0;
}
`
显然要把ans[20][20][20]的数据存储， 我是先建立表的， 效率还不够高

提高效率：递归的结果就直接返回到三维表中!!!