POJ 1741 Tree （树分治入门）
摘要：
TreeTime Limit:1000MSMemory Limit:30000KTotal Submissions:8554Accepted:2545DescriptionGive a tree with n vertices,each edge has a length(positive integer less than 1001).Define dist(u,v)=The min distance between node u and v.Give an integer k,for every pair (u,v) of vertices is called valid if and o 阅读全文
posted @ 2013-12-02 23:26 kuangbin 阅读(4545) 评论(5) 推荐(1) 编辑
