341 Non-Stop Travel (Dijsktra)
2013-03-08 20:11
323 查看
这是一道很典型的单源点最短路径问题,用Dij来解,记录路径,通过dfs来输出路径
代码如下:
#include <cstdio>
#include <cstring>
const int N = 20;
const int INF = 100000000;
int n, s, t, ans, icase;
int g
, d
, p
;
void dij() {
int mi, v;
for ( int i = 1; i <= n; ++i ) d[i] = INF;
d[s] = 0, ans = 0;
bool vis
;
memset( vis, 0, sizeof(vis) );
for ( int u = 0; u < n; ++u ) {
mi = INF;
for ( int i = 1; i <= n; ++i ) if ( !vis[i] && d[i] < mi ) mi = d[i], v = i;
vis[v] = true;
for ( int i = 1; i <= n; i++ ) if ( !vis[i] && g[v][i] >= 0 && d[i] > d[v] + g[v][i] ) d[i] = d[v] + g[v][i], p[i] = v;
}
}
void output( int x ) {
if ( x == -1 ) return;
output( p[x] );
if ( p[x] != -1 ) printf(" ");
printf("%d", x);
return;
}
int main()
{
icase = 1;
while ( scanf("%d", &n) != EOF && n ) {
for ( int i = 1; i <= n; p[i] = -1, ++i ) for ( int j = i; j <= n; ++j ) g[i][j] = g[j][i] = -1;
for ( int i = 1; i <= n; ++i ) {
int num;
scanf("%d", &num);
for ( int j = 1; j <= num; ++j ) {
int v, del;
scanf("%d %d", &v, &del);
g[i][v] = del;
}
}
scanf("%d%d", &s, &t);
dij();
printf("Case %d: Path = ", icase++);
output( t );
printf("; %d second delay\n", d[t]);
}
}
代码如下:
#include <cstdio>
#include <cstring>
const int N = 20;
const int INF = 100000000;
int n, s, t, ans, icase;
int g
, d
, p
;
void dij() {
int mi, v;
for ( int i = 1; i <= n; ++i ) d[i] = INF;
d[s] = 0, ans = 0;
bool vis
;
memset( vis, 0, sizeof(vis) );
for ( int u = 0; u < n; ++u ) {
mi = INF;
for ( int i = 1; i <= n; ++i ) if ( !vis[i] && d[i] < mi ) mi = d[i], v = i;
vis[v] = true;
for ( int i = 1; i <= n; i++ ) if ( !vis[i] && g[v][i] >= 0 && d[i] > d[v] + g[v][i] ) d[i] = d[v] + g[v][i], p[i] = v;
}
}
void output( int x ) {
if ( x == -1 ) return;
output( p[x] );
if ( p[x] != -1 ) printf(" ");
printf("%d", x);
return;
}
int main()
{
icase = 1;
while ( scanf("%d", &n) != EOF && n ) {
for ( int i = 1; i <= n; p[i] = -1, ++i ) for ( int j = i; j <= n; ++j ) g[i][j] = g[j][i] = -1;
for ( int i = 1; i <= n; ++i ) {
int num;
scanf("%d", &num);
for ( int j = 1; j <= num; ++j ) {
int v, del;
scanf("%d %d", &v, &del);
g[i][v] = del;
}
}
scanf("%d%d", &s, &t);
dij();
printf("Case %d: Path = ", icase++);
output( t );
printf("; %d second delay\n", d[t]);
}
}
相关文章推荐
- UVA 617 - Nonstop Travel
- UVa617 - Nonstop Travel
- 341 - Non-Stop Travel
- 多线程调试必杀技 - GDB的non-stop模式
- 多线程调试必杀技 - GDB的non-stop模式
- *** non-numeric second argument to `wordlist' function: ''. Stop错误解决办法
- MSN non-stop MediaPlayer
- gdb 新特性 non-stop
- how-to-stop-non-jailbroken-pirates-theory
- MSN non-stop MediaPlayer
- 多线程调试必杀技 - GDB的non-stop模式
- MSN non-stop MediaPlayer
- MSN non-stop MediaPlayer
- gdb 线程锁与non-stop模式
- Wandisco推出Non-Stop Namenode保证hadoop 100%运行时间
- 多线程调试必杀技 - GDB的non-stop模式
- MSN non-stop MediaPlayer
- 多线程调试必杀技 - GDB的non-stop模式
- /android-ndk/build/gmsl/__gmsl:512: *** non-numeric second argument to `wordlist' function: ''. Stop
- 多线程调试 GDB的non-stop模式