原题:http://poj.org/problem?id=1470
题意:有n个点,下面n行给定一棵树;
Q个询问,统计lca的种类及个数;
题目很水,就是输入好烦,最后找了discuss里大神的输入法
#include<stdio.h>
#include<string.h>
#include<queue>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1000;
int head[N], fa[N][20], dep[N];
int res[N], vis[N];
int n, m, e;
queue<int>q;
struct node
{
int to, nex;
}edge[N<<1];
void add(int u, int v)
{
edge[e].to = v;
edge[e].nex = head[u];
head[u] = e++;
}
void bfs(int root)
{
fa[root][0] = root;
dep[root] = 0;
q.push(root);
while(!q.empty())
{
int u = q.front();
q.pop();
for(int i = 1;i<20;i++)
fa[u][i] = fa[fa[u][i-1]][i-1];
for(int i = head[u];i!=-1;i = edge[i].nex)
{
int v = edge[i].to;
if(v == fa[u][0])
continue;
dep[v] = dep[u]+1;
fa[v][0] = u;
q.push(v);
}
}
}
int lca(int x, int y)
{
if(dep[x]<dep[y])
swap(x, y);
for(int i = 0;i<20;i++)
{
if((dep[x]-dep[y])&(1<<i))
x = fa[x][i];
}
if(x == y)
return x;
for(int i = 19;i>=0;i--)
{
if(fa[x][i]!=fa[y][i])
{
x = fa[x][i];
y = fa[y][i];
}
}
return fa[x][0];
}
int main()
{
while(scanf("%d", &n)!=EOF)
{
e = 0;
memset(head, -1, sizeof(head));
memset(res, 0, sizeof(res));
memset(vis, 0, sizeof(vis));
for(int i = 1;i<=n;i++)
{
int m, con;
scanf("%d:(%d)", &m, &con);
while(con--)
{
int x;
scanf("%d", &x);
add(m, x);
add(x, m);
vis[x] = 1;
}
}
for(int i = 1;i<=n;i++)
{
if(!vis[i])
bfs(i);
}
int Q;
scanf("%d", &Q);
while(Q--)
{
int u, v;
while(getchar()!='(');
scanf("%d%d", &u, &v);
res[lca(u, v)]++;
}
while(getchar()!=')');
for(int i = 1;i<=n;i++)
{
if(res[i]!=0)
printf("%d:%d\n", i, res[i]);
}
}
return 0;
}