every time choose a width as the minum width.
then the question has been transformed to solve the w/P,in which p is a virable while w is a constant number.
so just to try to get the minimu p which has the c no less than w.
> 用链表加排序啊，不要用回溯，指数时间肯定把机器都撑暴了

• what an old post you've just replied to... (232) frkstyc 2005-08-11 21:57:36
• Re:请问这题怎么做啊？ (232) singleagle 2005-10-20 13:44:30
• 没看懂。。。有中文的么-_- (232) Acsaga 2006-09-23 23:35:20