题目中要求有1w个点,所以我们用邻接表来建立图而不要用邻接矩阵
用degree来计算节点的度,选出一个叶子结点从他dfs一次最长路径,找到这个最长路径的结束点s,再从s来dfs求得最长路径
源码:
#include <iostream>
#include <memory.h>
#include <cstdio>
using namespace std;
int mx,mxp;
int degree[100005];
bool visit[100005];
/*邻接表*/
typedef struct node
{
int vertex;
int len;
node* next;
} pnode;//边表
typedef struct head
{
int head_node;
pnode* head_link;
}head_table;//顶点表
head_table head[100005];
void add_edge(int a,int b,int c)
{
pnode* temp = new pnode;
temp->vertex = b;
temp->len = c;
temp->next = head[a].head_link;
head[a].head_node = a;
head[a].head_link = temp;
}
void dfs(int v,int sum)
{
visit[v] = true;
pnode* w;
bool flag = true;
for(w = head[v].head_link;w;w=w->next)
{
if(!visit[w->vertex])
{
flag = false;
dfs(w->vertex,sum+w->len);
}
}
if(flag)
if(sum>mx)
{
mx = sum;
mxp = v;
}
return ;
}
int main()
{
int a,b,c;
int n = 0;
mx = 0;
int leaf;
while(cin>>a>>b>>c)
{
if(a+b+c == 0)
break;
add_edge(a,b,c);
add_edge(b,a,c);
degree[a]++;
degree[b]++;
if(a>n)
n = a;
if(b>n)
n = b;
}
if(n == 0)
{
cout<<"0"<<endl;
return 0;
}
for(int i=1;i<=n;i++)//枚举找出叶节点
if(degree[i] == 1)
{
leaf = i;
break;
}
memset(visit,false,sizeof(visit));
dfs(leaf,0);//从叶节点深搜最长
memset(visit,false,sizeof(visit));
dfs(mxp,0);//从最“边部”结点搜索另一个最“边部”的结点
cout<<mx<<endl;
return 0;
}