marvel真有钱啊# Movie - 无限影话
K*g
1 楼
write a program for placing of n hospitals, in M cities,distance between the
cities should be minimum. write the recursive expression.
Assuming n this set you have to find set of n cities which have minimum distance.
看上去像DP,但是好像subproblem的解不是更大一个subproblem的解,请大家讨论下
cities should be minimum. write the recursive expression.
Assuming n
看上去像DP,但是好像subproblem的解不是更大一个subproblem的解,请大家讨论下