lanshan1111的博客

题意：给出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...

http://poj.org/problem?id=1985DescriptionAfter 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 fo...

http://acm.hdu.edu.cn/showproblem.php?pid=4612 Problem Description 　　N planets are connected by M bidirectional channels that allow instant transportation. It's always possible to travel betw...

http://lightoj.com/login_main.php?url=volume_showproblem.php?problem=1094Given a tree (a connected graph with no cycles), you have to find the farthest nodes in the tree. The edges of the tree are w...