2016年9月10日
2016 ACM/ICPC Asia Regional Dalian Online HDU 5877 Weak Pair treap + dfs序
摘要： Weak Pair Problem Description You are given a rooted tree of N nodes, labeled from 1 to N. To the ith node a non-negative value ai is assigned.An orde 阅读全文
posted @ 2016-09-10 20:07 meekyan 阅读(623) 评论(0) 推荐(0)