E - Nearest Common Ancestors
POJ - 1330#include<stdio.h>
#include<cstdlib>
#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<queue>
using namespace std;
typedef long long LL;
int par[10010];//父亲
int ra[10010], rb[10010];
queue<int>road;
void init(int n) {
for (int i = 0; i <&