启发式合并
关注
分享
扫一扫
Mitsuha_
Rush to the dead summer
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
HDU-4358：Boring counting（树上启发式合并）
Boring counting Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 98304/98304 K (Java/Others) Problem Description In this problem we consider a rooted tree with N vertices. The vertices are num...原创 2018-08-24 16:36:15 · 486 阅读 · 0 评论 -
Codeforces-1009F：Dominant Indices（树上启发式合并）
F. Dominant Indices time limit per test4.5 seconds memory limit per test512 megabytes inputstandard input outputstandard output You are given a rooted undirected tree consisting of n vertices. Ve...原创 2018-08-23 20:28:53 · 558 阅读 · 0 评论