hihocoder #1069 : 最近公共祖先·三（ST求LCA）

题目：http://hihocoder.com/problemset/problem/1069?sid=1175440
思路：就是map存储求LCA，然而开始模板弄错了，wa了n次
代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<string>
using namespace std;

const int N = 200005;
struct edge
{
    int to,nxt,d;
    edge(int t = 0,int n = 0,int d = 0):to(t),nxt(n),d(d){}
}E[N*2];
int n;
int head[N*2],tot,deg[N];
int cnt,vis[N],f[N*2],rk[N*2],pos[N*2],dis[N],dp[N*2][35];
//f存储节点编号，rk存储节点深度，pos记录结点第一次出现的位置
map<string,int> mp;
string mm[N];
void init()
{
    memset(head,-1,sizeof(head));
    //memset(vis,0,sizeof(vis));
    for(int i = 0;i < N;i++)
        vis[i] = dis[i] = 0;
    tot = cnt = 0;
    mp.clear();
}
void add_edge(int s,int t,int d)
{
    E[tot] = edge(t,head[s],d);
    head[s] = tot++;
}
void dfs(int u,int depth)
{
    vis[u] = 1;
    f[++cnt] = u;
    pos[u] = cnt;
    rk[cnt] = depth;
    for(int i = head[u];~i;i = E[i].nxt)//访问所有子结点
    {
        int v = E[i].to,w = E[i].d;
        if(!vis[v])
        {
            //dis[v] = dis[u] + w;
            dfs(v,depth+1);
            f[++cnt] = u;
            rk[cnt] = depth;
        }
    }
}
void RMQ(int n)
{
    for(int i = 1;i <= n;i++)
        dp[i][0] = i;
    for(int j = 1;(1<<j) <= n;j++)
    {
        for(int i = 1;i+(1<<j)-1 <= n;i++)
        {
            int a = dp[i][j-1],b = dp[i + (1<<j-1)][j-1];
            dp[i][j] = rk[a] < rk[b] ? a : b;
        }
    }
}
int query(int l,int r)
{
    int k = (int)(log(r - l + 1.0) / log(2.0));
    int a = dp[l][k],b = dp[r-(1<<k)+1][k];
    return rk[a] < rk[b] ? a : b;
}
int LCA(int u,int v)
{
    int x = pos[u],y = pos[v];
    if(x > y) swap(x,y);
    int t = query(x,y);//找到深度最小的结点编号
    return f[t];
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t,n,m;
    init();
    cin >> n;
    string u,v;
    int num = 0;
    for(int i = 1;i <= n;i++)
    {
        cin >> u >> v;
        if(mp[u] == 0)
            mp[u] = ++num,mm[num] = u;
        if(mp[v] == 0)
            mp[v] = ++num,mm[num] = v;
        //cout << mp[u] << " " << mp[v] << "\n";
        add_edge(mp[u],mp[v],0);
        add_edge(mp[v],mp[u],0);
        deg[mp[v]]++;
    }
    dfs(1,1);
    RMQ(cnt);
    cin >> m;
    while(m--)
    {
        cin >> u >> v;
        int lca = LCA(mp[u],mp[v]);
        cout << mm[lca] << "\n";
    }
    return 0;
}