某島
… : "…アッカリ~ン . .. . " .. .
August 26, 2016
樹形 DP
難度:2
前提:
動態規劃
後繼:
資料:
…
習題:
SPOJ PT07Z. Longest path in a tree
樹的直徑
Codeforces Round AIM Tech Round 3 Problem C. Centroids
HDU 2196. Computer
HDU 5834. Magic boy Bi Luo with his excited tree
http://user.qzone.qq.com/251815992/blog/1410720943
2014-2015 ACM-ICPC, Asia Mudanjiang Regional Contest, Problem F. Fiber-optic Network
Posted by xiaodao
Category:
動態規劃
«
網路流
|
字元串
»
Custom
Default
Simplified
Traditional
Categories
open all
|
close all
Archives
open all
|
close all
Tweets by MinakoOikawa