#include <iostream>
#include <cstring>
using namespace std;
double f[35][35],a[35][35],b[35][35],ans,Max,Min,Exp,ave;
int i,j,n,m;
int main()
{
int c=0,T;
cin>>T;
while (T--)
{
c++;
cin>>n>>m;
Max=-1;
Min=99999999;
memset(f,0,sizeof(f));
memset(a,0,sizeof(f));
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
{
cin>>a[i][j];
f[i][j]=a[i][j];
}
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
if (f[i-1][j]>f[i][j-1])
f[i][j]=f[i][j]+f[i-1][j];
else f[i][j]=f[i][j]+f[i][j-1];
Max=(f[n][m])/(m+n-1);
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
f[i][j]=a[i][j];
for (i=1;i<=n;i++) f[i][0]=99999999;
for (j=1;j<=m;j++) f[0][j]=99999999;
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
{
if (f[i-1][j]<f[i][j-1])
f[i][j]=f[i][j]+f[i-1][j];
else f[i][j]=f[i][j]+f[i][j-1];
f[1][1]=a[1][1];
}
Min=f[n][m]/(m+n-1);
// cout<<Max<<" ..."<<Min<<endl;
Exp=1/(float)(m+n-1);
// cout<<exp<<endl;
ans=99999999;
ave=Min;
while (ave<=Max+0.00000001)
//for (ave=Min; ave<=Max; ave=ave+exp)
{
double temp;
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
f[i][j]=(a[i][j]-ave)*(a[i][j]-ave);
temp=f[1][1];
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
{
if (f[i-1][j]<f[i][j-1])
f[i][j]=f[i][j]+f[i-1][j];
else f[i][j]=f[i][j]+f[i][j-1];
f[1][1]=temp;
}
if (f[n][m]<ans) ans=f[n][m];
// cout<<f[n][n]<<"--"<<ave<<endl;
ave=ave+Exp;
// cout<<ave<<endl;
}
cout<<"Case #"<<c<<": "<<ans*(n+m-1)<<endl;
}
return 0
hdu 5492
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.