题意:
给出n,m,然后m条边,求树的直径。
思路:两遍dfs。
代码:
#include<iostream>
#include<algorithm>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define ll long long
#include<string.h>
#include<queue>
#include<stack>
#include<cstdio>
using namespace std;
const int maxn=50000+6;
#define mod 1000000007
#define INF 0x3f3f3f
int n,m,k;
struct node
{
int to;
int cost;
};
vector<node>edge[maxn];
int p,ans;
bool vis[maxn];
void dfs(int x,int len)
{
if(len>ans){
ans=len;
p=x;
}
for(int i=0;i<edge[x].size();i++)
{
int c=edge[x][i].cost;
int v=edge[x][i].to;
if(vis[v])continue;
vis[v]=1;
dfs(v,c+len);
vis[v]=0;
}
return ;
}
int main()
{
int m;
while(~scanf("%d %d",&n,&m))
{
rep(i,1,m)
{
int u,v,w;
char cc;
scanf("%d %d %d %c",&u,&v,&w,&cc);
edge[u].push_back(node{v,w});
edge[v].push_back(node{u,w});
}
p=1;
ans=0;
vis[1]=1;
dfs(1,0);
//cout<<p<<endl;
memset(vis,0,sizeof(vis));
vis[p]=1;
dfs(p,0);
printf("%d\n",ans);
}
}
#include<iostream>
#include<algorithm>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define ll long long
#include<string.h>
#include<queue>
#include<stack>
#include<cstdio>
using namespace std;
const int maxn=50000+6;
#define mod 1000000007
#define INF 0x3f3f3f
int n,m,k;
struct node
{
int to;
int cost;
};
vector<node>edge[maxn];
int p,ans;
bool vis[maxn];
void dfs(int x,int len,int fa)
{
if(len>ans){
ans=len;
p=x;
}
for(int i=0;i<edge[x].size();i++)
{
int c=edge[x][i].cost;
int v=edge[x][i].to;
if(v==fa)continue;
dfs(v,c+len,x);
}
return ;
}
int main()
{
int m;
while(~scanf("%d %d",&n,&m))
{
rep(i,1,m)
{
int u,v,w;
char cc;
scanf("%d %d %d %c",&u,&v,&w,&cc);
edge[u].push_back(node{v,w});
edge[v].push_back(node{u,w});
}
p=1;
ans=0;
vis[1]=1;
dfs(1,0,-1);
//cout<<p<<endl;
// memset(vis,0,sizeof(vis));
vis[p]=1;
dfs(p,0,-1);
printf("%d\n",ans);
}
}