POJ-1042 Gone Fishing (贪心法求最佳钓鱼方案
John is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-way road. John starts at lake 1, but he can finish at any lake he wants. He can only travel from on
原创
2014-05-06 08:43:21 ·
3041 阅读 ·
0 评论