hdu 5492 Find a path（dp+少量数学）2015 ACM/ICPC Asia Regional Hefei Online

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int M = 1000010;
const int Mod = 100000;
const int N = 33;
const int NN = 1800;

int t, n, m;
int dp

[NN], mp

;
int ans;

int Min(int x, int y)
{
if(x == -1) return y;
return x < y ? x : y;
}

void Dp()
{
memset(dp, -1, sizeof(dp));
dp[0][0][mp[0][0]] = mp[0][0]*mp[0][0];
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
if(i-1 >= 0)
{
for(int k = mp[i][j]; k < NN; k++)
{
if(dp[i-1][j][k-mp[i][j]] != -1)
{
dp[i][j][k] = Min(dp[i][j][k], dp[i-1][j][k-mp[i][j]]+mp[i][j]*mp[i][j]);
}
}
}
if(j-1 >= 0)
{
for(int k = mp[i][j]; k < NN; k++)
{
if(dp[i][j-1][k-mp[i][j]] != -1)
{
dp[i][j][k] = Min(dp[i][j][k], dp[i][j-1][k-mp[i][j]]+mp[i][j]*mp[i][j]);
}
}
}
}
}
}

int main()
{
//freopen("test.in", "r", stdin);
scanf("%d", &t);
for(int tm = 1; tm <= t; tm++)
{
scanf("%d%d", &n, &m);
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++) scanf("%d", &mp[i][j]);
}
Dp();
ans = -1;
for(int i = 0; i < NN; i++)
{
if(dp[n-1][m-1][i] != -1)
{
int mid = (n+m-1)*dp[n-1][m-1][i]-i*i;
if(ans == -1) ans = mid;
else ans = ans < mid ? ans : mid;
}
}
printf("Case #%d: %d\n", tm, ans);
}
return 0;
}