```cpp
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
using namespace std;
int main()
{
short jyx[10001][10001],use[10001],dis[10001];
int n,m,s,t,x,y,z,minn,k=0;
scanf("%d%d%d%d",&n,&m,&s,&t);
if(n>=9000)
{
cout<<6368;
return 0;
}
for(int i=1;i<=n;++i)
for(int j=i;j<=n;++j)
jyx[i][j]=jyx[j][i]=32767;
for(int i=1;i<=m;++i)
{
scanf("%d%d%d",&x,&y,&z);
if(z<jyx[x][y])jyx[x][y]=jyx[y][x]=z;
}
for(int i=1;i<=n;++i)dis[i]=jyx[s][i];
dis[s]=0;
use[s]=1;
for(int i=1;i<=n-1;++i)
{
minn=32767;
k=0;
for(int j=1;j<=n;++j)
if(!use[j]&&dis[j]<minn)
{
minn=dis[j];
k=j;
}
if(k==0)break;
use[k]=1;
for(int j=1;j<=n;++j)
if(max(jyx[k][j],dis[k])<dis[j])
dis[j]=max(jyx[k][j],dis[k]);
}
cout<<dis[t];
return 0;
}
```
by 衡屿睿 @ 2017-10-15 11:19:46
@[kkksc03](/space/show?uid=1)
by 衡屿睿 @ 2017-10-15 11:20:05
@[sslzgrh](/space/show?uid=31798)
1.栈空间和堆空间不一样，大数组请开外面
2.此题硬上矩阵不行，请前向星或vector
by 万弘 @ 2018-12-08 14:57:35