Kiritow/OJ-Problems-Source
1
0
Fork 0
mirror of https://github.com/Kiritow/OJ-Problems-Source.git synced 2024-03-22 13:11:29 +08:00
Code Issues Projects Releases Wiki Activity

Update 3562.cpp

Browse Source
This commit is contained in:
Kirigaya Kazuto 2016-10-12 10:38:32 +08:00 committed by GitHub
parent 9f8e736021
commit bf3396c4ad
1 changed files with 1 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
SDUTOJ/3562.cpp
View File

@ -9,8 +9,6 @@ using namespace std;
/** SPFA 单源最短路径算法 不支持负环*/ /** SPFA 单源最短路径算法 不支持负环*/
#define MAXN 1005 #define MAXN 1005
int d[MAXN];/// distance [ From S to ... ] int d[MAXN];/// distance [ From S to ... ]
bool v[MAXN];/// visit
int q[MAXN];/// 基于数组的队列(也可用queue等...)
int mp[MAXN][MAXN]; /// mp[i][j] i<--> j is connected. int mp[MAXN][MAXN]; /// mp[i][j] i<--> j is connected.
int n;/// n is the number of max Point . int n;/// n is the number of max Point .
@ -22,11 +20,9 @@ void spfa(int StartPoint) /// d[i] is the min distance from StartPoint to i ( Bo
{ {
if(mp[0][i]!=INF)path[i]=i;//Path Init if(mp[0][i]!=INF)path[i]=i;//Path Init
d[i]=INF; d[i]=INF;
v[i]=0;
} }
queue<int> bus; queue<int> bus;
bus.push(StartPoint); bus.push(StartPoint);
v[StartPoint]=1;
d[StartPoint]=0; d[StartPoint]=0;
while(!bus.empty()) while(!bus.empty())
{ {
@ -41,7 +37,7 @@ void spfa(int StartPoint) /// d[i] is the min distance from StartPoint to i ( Bo
{ {
d[i]=d[c]+mp[c][i]; d[i]=d[c]+mp[c][i];
//path[i]=min(path[i],path[c]); //path[i]=min(path[i],path[c]);
if(!v[i]) if(i)
{ {
if(c) path[i]=path[c]; if(c) path[i]=path[c];
bus.push(i); bus.push(i);