动态规划
boywgw
这个作者很懒,什么都没留下…
展开
-
【算法】【动态规划】Subset Sum
问题描述: When you divide numbers from 1 to N into two subsets, you can make each subset sum equal. For example, if N is 3, elements of the entire set are {1, 2, & 3}. In case each set sum is equal,原创 2015-08-27 15:58:00 · 2967 阅读 · 1 评论 -
【算法】【动态规划】Bus Fare
问题描述: In a city, a bus stops every kilometer. Also the bus fare is different from 1km to 10km, so you can use each section well to decrease the total fare to get to the destination. For example, l原创 2015-08-25 15:49:41 · 1400 阅读 · 0 评论