sicily 1024 Magic Island

题意：求无向图路径中的最大带权值.

解法：深搜

 // Problem#: 9859
 // Submission#: 2661875
 // The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
 // URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
 // All Copyright reserved by Informatic Lab of Sun Yat-sen University
 #include<iostream>
 #include<vector>
 #include<stack>
 #include<memory.h>
 using namespace std;

 struct  Road{
     int From;
     int Dest;
     int Dist;
     Road(int f,int de,int di){
         From = f;
         Dest = de;
         Dist = di;
     }
 };
 vector<Road> roads[];
 bool visited[];

 int longest;
 void DSF(int k,int cur){
     if(cur > longest){
         longest = cur;
     }
     visited[k] = true;
     for(int i=;i<roads[k].size();i++){
         int dest = roads[k][i].Dest;
         int dist = roads[k][i].Dist;
         if(visited[dest])
             continue;
         DSF(dest,cur+dist);
     }
     //clear visited mark
     visited[k] = false;
 }
 int main(){
     int N,K;
     while(cin>>N>>K){
         int from,dest,dist;
         longest = ;
         memset(roads,,sizeof(roads));
         memset(visited,false,sizeof(visited));
         //input
         for(int i=;i<N-;i++){
             cin >> from >> dest >> dist;
             Road rF = Road(from,dest,dist);
             Road rD = Road(dest,from,dist);
             roads[from].push_back(rF);
             roads[dest].push_back(rD);
         }
         DSF(K,longest);
         cout << longest <<endl;
     }
     return ;
 }