2018年4月11日
寻找树上的最大权值路径
摘要： BENEFACT - The Benefactor #shortest-path #dfs #shortest-path #dfs Another chapter of the municipal chronicles of a well known unbelievable lordly majo 阅读全文
posted @ 2018-04-11 21:29 *zzq 阅读(1269) 评论(0) 推荐(0)
Spoj-COINS-记忆化dp
摘要： COINS - Bytelandian gold coins #dynamic-programming #dynamic-programming In Byteland they have a very strange monetary system. Each Bytelandian gold c 阅读全文
posted @ 2018-04-11 18:22 *zzq 阅读(262) 评论(0) 推荐(0)
SPOJ-CLEANRBT-状压dp
摘要： CLEANRBT - Cleaning Robot #dynamic-programming #bfs #dynamic-programming #bfs Here, we want to solve path planning for a mobile robot cleaning a recta 阅读全文
posted @ 2018-04-11 17:57 *zzq 阅读(347) 评论(0) 推荐(0)
spoj-ASSIGN-bitDP
摘要： ASSIGN - Assignments #dynamic-programming #dynamic-programming Problem Your task will be to calculate number of different assignments of n different t 阅读全文
posted @ 2018-04-11 15:23 *zzq 阅读(202) 评论(0) 推荐(0)
spoj-ANARC05H -dp
摘要： ANARC05H - Chop Ahoy! Revisited! #dynamic-programming #dynamic-programming Given a non-empty string composed of digits only, we may group these digits 阅读全文
posted @ 2018-04-11 14:50 *zzq 阅读(224) 评论(0) 推荐(0)
Light oj 1379 -- 最短路
摘要： In Dhaka there are too many vehicles. So, the result is well known, yes, traffic jam. So, mostly people have to spend quite a time in the roads to go 阅读全文
posted @ 2018-04-11 11:33 *zzq 阅读(153) 评论(0) 推荐(0)