search

mkmojo / aoapc-book

Automatically exported from code.google.com/p/aoapc-book
1 stars 0 forks source link

勘误 #48

Open GoogleCodeExporter opened 8 years ago

GoogleCodeExporter commented 8 years ago 
第50页
left(i,j)= max(left(i-1,j), lo+1);

我认为应更改如下
left(i,j)= max(left(i,j-1), lo+1);

希望尽快核实

Original issue reported on code.google.com by 654321...@gmail.com on 31 Mar 2015 at 6:45

GoogleCodeExporter commented 8 years ago 
书中应该写明，每一个点的left right up都是以 
这个格子向上延伸的高度为前提的 向左伸展和向右伸展

Original comment by 654321...@gmail.com on 31 Mar 2015 at 6:59

GoogleCodeExporter commented 8 years ago 
书中的结论是没有任何问题的，  但是 运动极限  
的说法太生动了

Original comment by 654321...@gmail.com on 31 Mar 2015 at 7:00