AC_kereo的专栏

题意：n个节点的一棵树，m次询问：求以x为根y的父亲节点。思路：lca倍增算法。利用bfs求出每个节点的深度以及2^i倍祖先。接下来求x和y的lca,如果lca!=y,那么y的父节点就是ancestor[y][0],不然求x的depth[x]-depth[y]-1祖先结点。画图还是比较看粗来的，详见程序：#include#include#include#include#includ

Language:DefaultNetworkTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3827 Accepted: 1095DescriptionYixght is a manager of the company called Szq

Language:DefaultNearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17123 Accepted: 9115DescriptionA rooted tree is a well-kno

Language:DefaultClosest Common AncestorsTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 14915 Accepted: 4745DescriptionWrite a program that takes

Language:DefaultThe merchantTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 3020 Accepted: 999DescriptionThere are N cities in a country, and ther

Language:DefaultDistance QueriesTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 8740 Accepted: 3065Case Time Limit: 1000MSDescriptionFarmer

Language:DefaultNetworkTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6617 Accepted: 2341DescriptionA network administrator manages a large netwo