题目链接: UVA - 10970 Big Chocolate
给你m行n列的矩形巧克力,求你最少用几刀可以将它切成m*n个1×1的巧克力。据说有非DP的解法,以后补上,AC的代码有一些细节方面也没有考虑,也许某个循环是可以省略的。这里采用DP解法,用dp[m][n]表示将m行n列的巧克力切成单个需要多少部。需要注意的是对于所有的case,dp是不用重新初始化的。
# include <cstdlib>
# include <cstdio>
# include <algorithm>
# include <cmath>
# include <cstring>
# include <climits>
using namespace std;
const int size = 300 + 5;
int dp[size][size];
int gettime(int m,int n)
{
if (m < n)
swap(m,n);
if (dp[m][n]!=-1)
return dp[m][n];
if (n==1)
return dp[m][n] = m-1;
dp[m][n] = INT_MAX;
for (int i=1;i<=m/2;i++)
dp[m][n] = min(dp[m][n],gettime(m-i,n)+gettime(i,n) + 1);
for (int i=1;i<=n/2;i++)
dp[m][n] = min(dp[m][n],gettime(m,n-i)+gettime(m,i) + 1);
return dp[m][n];
}
int main()
{
int n,m;
memset(dp,-1,sizeof(dp));
while (scanf("%d%d",&m,&n)!=EOF)
{
printf("%d\n",gettime(m,n));
}
return 0;
}