Micheal_bearboy的专栏

原创 POJ 1330 LCA+并查集求最近公共祖先

<br />Problem：<br /><br />http://poj.org/problem?id=1330<br /> <br /> <br />my code:<br /> <br />#include<stdio.h> #include<string.h> #include<vector> #include<iostream> #define MAX 10005 using namespace std; vector<int> tree[MAX],Q[MAX]; int fath