Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

mst+线段数(数组): 构建mst , dfs标id,id数组存放每个节点,每个子树的id range是连续的,然后分别从左向右,从右向左扫描,range min查询

Posted by lddlinan at 2021-01-26 10:27:56 on Problem 4006
代码整理了一下,排名第二,有点不开心。。。。。

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator