（乙）1003 我要通过！

#include 
#include 
using namespace std;
int maxx=0,minn=9999999,cnt;
int n,m,c1,c2,man[501],a[501],b[501],c[501][501],r[501];
bool pan[501];
int dfs(int from,int to,int amount,int len)
{
	if(from==to)
	{
		if(lenmaxx)
			maxx=amount;
		}
	}
	else
	{
		for(int i=0;i>n>>m>>c1>>c2;
	for(int i=0;i>man[i];
	}
	for(int i=0;i>a[i]>>b[i]>>r[i];
		c[a[i]][b[i]]=r[i];
		c[b[i]][a[i]]=r[i];
	}
	pan[c1]=1;
	dfs(c1,c2,man[c1],0);
	cout<