SPOJ - PT07J Query on a tree III主席树
SPOJ - PT07J Query on a tree III 主席树You are given a node-labeled rooted tree with n nodes.
Define the query (x, k): Find the node whose label is k-th largest in the subtree of the node x. Assume no tw
原创
2017-11-01 07:32:47 ·
175 阅读 ·
0 评论