题意: 给出n 个农场 , 和t条双向路径
, 求从农场1 到 你的最短距离?
出题人有意思 , 输入时 ,题目先输入 t , 再输入 n
#include
#include
#include
#include
using namespace std;
#define max(u , v) (u)>(v)?(u):(v)
#define min(u , v) (u)<(v)?(u):(v)
const int INF = 0xfffffff;
const int maxn = 2010;
int grap[maxn][maxn] , dist[maxn] , pre[maxn];
int n , m ;
void init()
{
int i , j;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
grap[i][j] = INF;
memset(pre , 0 , sizeof(pre));
}
void dijkstra()
{
int i , j;
for(i = 1; i <= n; i++)
dist[i] = grap[1][i];
pre[1] = 1;
int x = 1;
for(j = 1; j < n; j++)
{
int maxs =INF;
for(i = 1; i <= n; i++)
if(!pre[i] && maxs > dist[i])
{
maxs = dist[i];
x = i;
}
pre[x] = 1;
//
cout<<dist[n]<<endl;
for(i = 1; i <= n; i++)
if(!pre[i] && (grap[x][i]+dist[x]) < dist[i] )
dist[i] = grap[x][i] + dist[x];
}
}
int main()
{
while(scanf("%d %d" , &m , &n) != EOF)
{
init();
int i , x , y , z;
for(i = 0; i < m; i++)
{
scanf("%d %d %d" , &x , &y , &z);
if(grap[x][y] > z)
grap[x][y] = grap[y][x] = z;
}
dijkstra();
cout<<dist[n]<<endl;
}
return 0;
}
出题人有意思 , 输入时
#include
#include
#include
#include
using namespace std;
#define max(u , v)
#define min(u , v)
const int INF = 0xfffffff;
const int maxn = 2010;
int grap[maxn][maxn] , dist[maxn] , pre[maxn];
int n , m ;
void init()
{
}
void dijkstra()
{
}
int main()
{
}