杭电OJ dj算法

最短路

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 79357    Accepted Submission(s): 34408

Problem Description

在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候，却是非常累的！所以现在他们想要寻找最短的从商店到赛场的路线，你可以帮助他们吗？

 

Input

输入包括多组数据。每组数据第一行是两个整数N、M（N<=100，M<=10000），N表示成都的大街上有几个路口，标号为1的路口是商店所在地，标号为N的路口是赛场所在地，M则表示在成都有几条路。N=M=0表示输入结束。接下来M行，每行包括3个整数A，B，C（1<=A,B<=N,1<=C<=1000）,表示在路口A与路口B之间有一条路，我们的工作人员需要C分钟的时间走过这条路。

输入保证至少存在1条商店到赛场的路线。

 

Output

对于每组输入，输出一行，表示工作人员从商店走到赛场的最短时间

 

Sample Input

2 1

1 2 3 

3 3 

1 2 5 

2 3 5 

3 1 2

0 0

 

Sample Output

3 

2

迪杰斯特拉算法

找一个定点与各个地方的最短路

通过先向二维数组里放距离

寻找从定点走向各个点的最短路，并标记

然后以此为基点判断是否能使两点更短，若能，更改

小老师的方法

#include <iostream>

#include <cstdio>

#include <iomanip>

#include <cstring>

#include <algorithm>

#define inf 0x3f3f3f3f

using namespace std;

int n, m, i;

int dj[1000000];

int lj[1000][1000];

int pd[1000000];

int djstla( int x )

{

       memset(pd, 0, sizeof (pd));

       dj[1] = 0;

        while (1)

       {

               int v = -1;

               for ( int i = 1; i <= n; i++)

                       if (!pd[i] && (v == -1 || dj[v]>dj[i]))    //找出最小值的序号//

                             v = i;

               if (v == -1) break ;

              pd[v] = 1;

               for ( int i = 1; i <= n; i++)

                       if (!pd[i]) dj[i] = min(dj[i], dj[v] + lj[v][i]);   //判断实际最短路//

       }

        return dj[n];

}

int main()

{

        while (cin >> n >> m)

       {

              memset(dj, inf , sizeof (dj));

              memset(lj, inf , sizeof (lj));

               if (n == 0 && m == 0) break ;

               for (i = 1; i <= m; i++)

              {

                       int a, b, c;

                      cin >> a >> b >> c;

                       if (lj[a][b] > c)         //小心输入1 1 1  1 1 2，要判断//

                      {

                             lj[a][b] = c;           //二维数组存距离//

                             lj[b][a] = c;

                      }

              }

              cout << djstla(1) << endl;

       }

         return 0;

}

我的

#include <iostream>

#include <cstdio>

# include <iomanip>

#include <cstring>

#include <algorithm>

#define inf 0x3f3f3f3f

using namespace std;

int n, m, i;

int dj[1000000];

int lj[1000][1000];

int pd[1000000];

int djstla( int x)

{

       memset(pd, 0, sizeof (pd));

       pd[1] = 1;

       dj[1] = -1;

        while (1)

       {

               int k = -1;

               int p = inf;

               for (i = 1; i <= n; i++)

              {

                       if (dj[i] < p&&pd[i] != 1)

                      {

                             p = dj[i];

                             k = i;

                      }

              }

               if (k == -1) break ;

              pd[k] = 1;

               for (i = 1; i <= n; i++)

              {

                       if (pd[i] != 1 && dj[i] > dj[k] + lj[k][i]) dj[i] = dj[k] + lj[k][i];

              }

       }

        return (dj[n]);

}

int main()

{

        while (cin >> n >> m)

       {

              memset(dj, inf, sizeof (dj));

              memset(lj, inf, sizeof (lj));

               if (n == 0 && m == 0) break ;

               for (i=1;i<=n;i++) lj[i][i] = 0;

               for (i = 1; i <= m; i++)

              {

                       int a, b, c;

                      cin >> a >> b >> c;

                       if (lj[a][b] > c)

                      {

                              if (a == 1) dj[b] = c;

                              else if (b == 1) dj[a] = c;

                             lj[a][b] = c;

                             lj[b][a] = c;

                      }

              }

              cout << djstla(1) << endl;

       }

        return 0;

}