OJ Board

I've been thinking and trying to code something since this morning and I'm stuck. Could anyone give me hints on how to solve this one? I know the algorithms to find a tree's diameter and everything that's needed, I guess. I just don't know really what to do. The book says "cut worst edge". But what ...

OMG What's wrong with that code? I keep getting WA for no reason!
I've read it soo many times and it seems absolutely right @__@
Please help!

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>

using namespace std ...

:( What's wrong with this code? It all seems right to me, it must be some corner case I'm missing.
Could someone please help?

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <cstring>
#include <stack>
#include <queue>
typedef unsigned long ...

brianfry713 wrote:init() needs to initialize pset[1] through pset[n].

Thank you so much

It didn't solve it

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <stdlib.h>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include ...