Problem A. Play with a Tree
无向图删边游戏
Problem B. The easiest problem
树的最大毛毛虫
Problem C. The GbAaY Kingdom
最小直径生成树
Problem D. Let’s count 1 2 3
有/无标号、有/无根树计数
Problem E. Yet another computer network problem
？？？
Problem F. A short vacation in Disneyland
树的最小路径覆盖
Problem G. Colorful Lights Party
???
Problem H. Search in XML
树模式匹配
Problem I. The ants in a tree
综合题、最近公共祖先
Problem J. Query on a tree III
划分树
Problem K. JiaJia’s balloons
??
Problem X. Vertex Cover
Problem Y. Is it a tree?
树的判定。
Problem Z. Longest path in a tree
树的最长路径

External link:

http://adn.botao.hu/?p=67

Posted by xiaodao
Category: SPOJ, 快晴