RMQ实现LCA

RMQ实现LCA。。。。。。。。。。弄了一下午，终于搞定了。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<climits>
using namespace std;

const int N = 100005; //不同结点数
const int M = N * 2; //总结点数
int visit[M], level[M], first[N];
int q[20][N];
int num;

struct Node
{
    int father;
    vector<int> son;
    Node()
    {
        father = -1;
        son.clear();
    }
}node[N];

void DFS(int cur, int now)
{
     if(first[now] == -1)
        first[now] = num;
    level[num] = cur;
    visit[num++] = now;

    if(node[now].son.size() == 0) //终止条件
        return ;

    for(vector<int>::iterator i = node[now].son.begin(); i != node[now].son.end(); ++i)
        {
            DFS(cur + 1, *i);
            visit[num] = now;
            level[num++] = cur;
        }
}

void RMQ(int n)
{
    for(int i = 1; i <= n; ++i)
        q[0][i] = level[i];
    for(int i = 1; i != 20; ++i)
        for(int j = 1; j <= n; ++j)
            if(j + (1 << i) - 1 <= n)
                q[i][j] = min(q[i - 1][j], q[i - 1][j + (1 << i >> 1)]);
}

int main()
{
    int vnum, edge, query;
    int a, b;
    int start, end;
    while(scanf("%d %d %d", &vnum, &edge, &query) != EOF)
    {
        memset(first, -1, sizeof(first));
        num = 1;
        for(int i = 0; i < edge; ++i)
        {
            scanf("%d %d", &a, &b);
            node[a].son.push_back(b);
            node[b].father = a;
        }
        DFS(0, 1);
        RMQ(num - 1);
        while(query--)
        {
            scanf("%d %d", &start, &end);
        start = first[start], end = first[end];
        if(start > end)
            swap(start, end);
        int k = (int)(log(end - start + 1.0) / log(2.0));
        int res = min(q[k][start], q[k][end - (1 << k) + 1]);
        int ans;
        for(int i = start; i <= end; ++i)
            if(level[i] == res)
            {
                ans = i;
                break;
            }
        printf("%d\n", visit[ans]);
        }
    }
    return 0;
}