水题。
#include <cstring>
#include <cstdio>
#include <string>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
#define INF 100000000
int flag[][];
double dis[][];
int main()
{
int i,j,n,m,k,x,y;
double temp;
scanf("%d%d%d",&n,&m,&k);
for(i = ;i <= k;i ++)
{
scanf("%d%d",&x,&y);
flag[x][y] = ;
}
for(i = ;i <= n;i ++)
{
for(j = ;j <= m;j ++)
dis[i][j] = INF;
}
dis[][] = ;
temp = *sqrt(2.0);
for(i = ;i <= n;i ++)
{
for(j = ;j <= m;j ++)
{
if(i- >= )
dis[i][j] = min(dis[i-][j]+,dis[i][j]);
if(j- >= )
dis[i][j] = min(dis[i][j-]+,dis[i][j]);
if(flag[i][j])
dis[i][j] = min(dis[i-][j-]+temp,dis[i][j]);
}
}
printf("%.0lf\n",dis[n][m]);
return ;
}