我得先把你的代码“格式化”一下(手动滑稽)
```cpp
// luogu-judger-enable-o2
include<iostream>
int x=10000001;
using namespace std;
int main(){
int dis[x],i,k,n,m,u[x],v[x],w[x],check=0,flag,s;
long long inf=9999999999;
cin>>n>>m>>s;
for(i=1;i<=m;i++){
cin>>u[i]>>v[i]>>w[i];
}
for(i=1;i<=n;i++){ dis[i]=inf; }
dis[s]=0;
for(k=1;k<=n-1;k++){
check=0;
for(i=1;i<=m;i++){
if(dis[v[i]]<inf&&dis[u[i]]<inf&&dis[v[i]]>dis[u[i]]+w[i]){
dis[v[i]]=dis[u[i]]+w[i];
check=1;
}
}
if(check==0) break;
}
for(i=1;i<=n;i++){
if(dis[i]==inf){
cout<<"2147483647"<<" ";
}
else {
cout<<dis[i]<<" ";
}
}
return 0;
}
```
by AThousandSuns @ 2018-02-05 18:52:02
大哥排版。
by moye到碗里来 @ 2018-02-05 18:52:14
这貌似并不是一个正确的算法。。。。。。建议上网搜一下dijkstra算法和SPFA算法,不理解的话即使贴代码也没用
(话说这个能90分?)
by AThousandSuns @ 2018-02-05 18:53:43
v4h8
by zhumengdexiaobai @ 2018-02-14 17:38:16