树
关注
分享
扫一扫
文章平均质量分 87
SF-_-
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
HDU 5209 Relief grain 解题报告（树链剖分 + 线段树）
Relief grainTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 325 Accepted Submission(s): 76Problem DescriptionThe soil is c原创 2014-09-22 19:43:45 · 1012 阅读 · 0 评论 -
POJ 1741 Tree 解题报告（树分治）
TreeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 10589 Accepted: 3257DescriptionGive a tree with n vertices,each edge has a length(positive integer原创 2014-09-23 14:40:42 · 1135 阅读 · 0 评论 -
HDU 4822 Tri-war 解题报告（LCA）
Tri-warTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 125 Accepted Submission(s): 37Problem DescriptionThree countries, Re原创 2014-09-16 11:03:26 · 1520 阅读 · 0 评论 -
SPOJ 1825 Free tour II 解题报告（树分治）
#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#pragma comment(linker, "/STACK:1024000000,1024000000")#de原创 2014-10-02 14:14:25 · 1041 阅读 · 0 评论 -
SPOJ 375. Query on a tree 解题报告（树链剖分）
375. Query on a treeProblem code: QTREEYou are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1.We will ask you to perfrom原创 2014-10-03 09:32:07 · 1172 阅读 · 0 评论