Educational Codeforces Round 1 E Chocolate Bar（dp）

题意:

$给定N*M(N,M\le 30)的巧克力, 现在要吃掉K\le 50的面积的$
$且要求吃掉的一定是长方形, 剩余部分的形状不做要求$
$可以切割巧克力, 花费是切割的长度的平方$

分析:

$暴力dp, dp[i][j][k]:=i*j的巧克力吃了k面积的最小花费$
$转移就枚举咋切, 横切还是纵切, 以及分成的两块各吃多少$

代码:

//
//  Created by TaoSama on 2016-01-19
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, m, k;
int dp[35][35][55];

int dfs(int n, int m, int k) {
    if(!k || n * m == k) return 0;
    int &ret = dp[n][m][k];
    if(~ret) return ret;
    ret = INF;
    for(int i = 1; i < n; ++i)
        for(int j = 0; j <= k; ++j)
            ret = min(ret, dfs(i, m, j) + dfs(n - i, m, k - j) + m * m);
    for(int i = 1; i < m; ++i)
        for(int j = 0; j <= k; ++j)
            ret = min(ret, dfs(n, i, j) + dfs(n, m - i, k - j) + n * n);
    return ret;
}

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    int t; scanf("%d", &t);
    memset(dp, -1, sizeof dp);
    while(t--) {
        scanf("%d%d%d", &n, &m, &k);
        printf("%d\n", dfs(n, m, k));
    }
    return 0;
}