今天学习了树的直径,重心和基环树,直切主题吧~~
一,树的直径
---------------------------------------------------第一次更新于2019.2.13-----------------------------------------------
After hearing about the epidemic of obesity in the USA, Farmer John wants his cows to get more exercise, so he has committed to create a bovine marathon for his cows to run. The marathon route will include a pair of farms and a path comprised of a sequence of roads between them. Since FJ wants the cows to get as much exercise as possible he wants to find the two farms on his map that are the farthest apart from each other (distance being measured in terms of total length of road on the path between the two farms). Help him determine the distances between this farthest pair of farms.
Input
* Lines 1.....: Same input format as "Navigation Nightmare".
Output
* Line 1: An integer giving the distance between the farthest pair of farms.
Sample Input
7 6
1 6 13 E
6 3 9 E
3 5 7 S
4 1 3 N
2 4 20 W
4 7 2 S
Sample Output
52
Hint
The longest marathon runs from farm 2 via roads 4, 1, 6 and 3 to farm 5 and is of length 20+3+13+9+7=52.
这是树的直径的模板题,代码也相当好打
请看
#include<cstring>
#include<cstdio>
#include<queue>
#define MAXN 100100
using namespace std;
struct ss
{
int to,next,v;
}e[MAXN];
bool vis[MAXN];
int dis[MAXN],last[MAXN],len,ans,s,n,m;
void insert(int x,int y,int z)
{
e[++len].next=last[x];
e[len].to=y;
e[len].v=z;
last[x]=len;
}
void bfs(int x)
{
int i,j,now;
que