poj 1741 Tree 树的分治
摘要:
题意:给定一棵边带权的树,求多少对点之间的距离小于k 1 #include<iostream> 2 #include<cmath> 3 #include<cstdio> 4 #include<cstring> 5 #include<algorithm> 6 using namespace std; 7 #define NMAX 10010 8 struct node 9 {10 int num,weight;11 node *next;12 };13 node *graph[NMAX];14 node memo[2*NMAX];15 阅读全文
posted @ 2012-03-04 21:52 myoi 阅读(388) 评论(3) 推荐(0) 编辑