uva 1629 动规

#include <bits/stdc++.h>
using namespace std;
const int maxn = 20 + 5;
const int INF = 0x3f3f3f3f;
#define REP(i,j,n) for(int i=(j);i<=(n);i++)
int n, m, k, inp[maxn][maxn], cnt[maxn][maxn], kase, dp[maxn][maxn][maxn][maxn], a, b;
int DP(int i, int j, int k, int l)
{
	int &res = dp[i][j][k][l];
	if (res != 0) return res;
	int cherry = cnt[k][l] - cnt[i - 1][l] - cnt[k][j - 1] + cnt[i - 1][j - 1];
	if (cherry == 0) return INF;
	if (cherry == 1) return 0;
	res = INF;
	REP(a, i, k) res = min(res, DP(i, j, a, l) + DP(a + 1, j, k, l) + l - j + 1);
	REP(b, j, l) res = min(res, DP(i, j, k, b) + DP(i, b + 1, k, l) + k - i + 1);
	return res;
}
int main(int argc, char const *argv[])
{
	while (cin >> n >> m >> k)
	{
		memset(cnt, 0, sizeof(cnt));
		memset(dp, 0, sizeof(dp));
		memset(inp, 0, sizeof(inp));
		while (k--) cin >> a >> b, inp[a][b] = 1;
		REP(i, 1, n) REP(j, 1, m) cnt[i][j] = cnt[i - 1][j] + cnt[i][j - 1] - cnt[i - 1][j - 1] + inp[i][j];
		cout << "Case " << ++kase << ": " << DP(1, 1, n, m) << endl;
	}
	return 0;
}

题目本身不难,没有想到统计樱桃个数的方法学习了