题意:给定n*m的矩阵(n<=30,m<=30),矩阵每个点的g[i][j]<=30,求从矩阵的从左上角开始拿数,每次只能向下和向右走问直到右下角
(N+M−1)∑N+M−1i=1(Ai−Aavg)2 最小。
solve
这个式子我找不到任何有用的规律。通过化简这个式子变成(n+m-1)*sum(ai*a[i])-sum(a[i])*sum(a[i]).发现当sum(a[i]*a[i])的值固定,sum(a[i])越大,结果越小。但是sum(a[i]*a[i])*值高达50000多,过大,不如当sum(a[i])的值相等,sum(a[i]*a[i])小答案越小。sum(a[i])不超过1800可以用dp。然后用dp求出到达右下角的路线中每个sum(a[i])对应的最小sum(a[i]*a[i]).
ACcode
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
int dp[31][31][1801];
int g[33][33],n,m,o,ans;
int main()
{
int TA,cas=1;
scanf("%d",&TA);
while(TA--)
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
scanf("%d",&g[i][j]);
}
memset(dp,0x3f,sizeof(dp));
o=(n+m-1)*30;
dp[1][1][g[1][1]]=g[1][1]*g[1][1];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
for(int k=0;k<=o;k++)
{
if(dp[i][j][k]==INF)continue;
if(i<n)
dp[i+1][j][k+g[i+1][j]]=min(dp[i+1][j][k+g[i+1][j]],
dp[i][j][k]+g[i+1][j]*g[i+1][j]);
if(j<m)
dp[i][j+1][k+g[i][j+1]]=min(dp[i][j+1][k+g[i][j+1]],
dp[i][j][k]+g[i][j+1]*g[i][j+1]);
}
}
}
int ans=INF;
for(int i=0;i<=o;i++)
{
if(dp[n][m][i]==INF)continue;
ans=min(ans,dp[n][m][i]*(n+m-1)-i*i);
}
printf("Case #%d: %d\n",cas++,ans);
}
return 0;
}