以uu为起点,dfs/bfs找出与它最远的点vv 则d(u,v)d(u,v)是一条直径 下面给出poj1985的code(poj2631自行修改) #include<iostream>#include<cstdio>#include<cstring>#definere registerusingnamespacestd;intmax(int&a,int&b){returna>b?a:b;}#defineN 50002intn,m,k,ans,dis[N];intcnt,hd[N],n...
单就这两道题而言,无非是某节点到其所有后继节点的状态转移。 poj1985 是求 树的直径。可以随便选择一个点开始进行bfs或者dfs,从而找到离该点最远的那个点(可以证明,离树上任意一点最远的点一定是树的某条直径的两端点之一;树的直径:树上的最长简单路径)。再从找到的点出发,找到据该点的最远点,那么这两点...
1998(HTML, sample solution in C++ and test data) 1999(PDF, test data and sample solutions in java/C++) 2000(Problem Set in PDF, sample solutions in java/C++, test data) 2001(Problem set in html; test data, sample solutions in java/C++) 1993(Problems in HTML; sample solution in C; ...
1998(HTML, sample solution in C++ and test data) 1999(PDF, test data and sample solutions in java/C++) 2000(Problem Set in PDF, sample solutions in java/C++, test data) 2001(Problem set in html; test data, sample solutions in java/C++) 1993(Problems in HTML; sample solution in C; ...
2000(Problem Set in PDF, sample solutions in java/C++, test data) 2001(Problem set in html; test data, sample solutions in java/C++) 1993(Problems in HTML; sample solution in C; test data) 1994(Problems in HTML; sample solution in C; test data) ...
在SICP 出版的同一年, 本贾尼·斯特劳斯特卢普(Bjarne Stroustrup)发布了 C++ 语言的首个版本,它将面向对象编程带到了大众面前。几年之后,Lisp 计算机的市场崩盘,AI 寒冬开始了。在下一个十年的变革中, C++ 和后来的 Java 成了前途无量的语言,而 Lisp 被冷落,无人问津。
1015 Jury Compromise DP 1016 Numbers That Count 送分题 1017 Packets 贪心 1018 Communication System 贪心 1019 Number Sequence 送分题 1020 Anniversary Cake 搜索 1023 The Fun Number System 数论 1025 Department 模拟 1026 Cipher 组合数学 1027 The Same Game 模拟 ...
2001(Problem set in html; test data, sample solutions in java/C++) 1993(Problems in HTML; sample solution in C; test data) 1994(Problems in HTML; sample solution in C; test data) 1995(Problems in HTML; sample solutions in C)