自上次登山成功之后,登山俱乐部决定将难度加大,考虑每个队员的负载量与消耗量各不相同的情况。假定登山俱乐部有六名成员,山高(以天数计):N=6。那么,选谁做登顶者?谁第一支援?谁第二支援?……从策略上要优先考虑可独行天数多的人往前排,这样,需要别人支援的天数少。因此,在选择队员时可采用动态定界的深度优先搜索策略。先算搜索树中左起第一个,即首选4~#队员登顶,上下山12天,共需12千克给养;他自带9千克给养,可独行9天,第三天,需别人支援。我们用需要的给养数(total)和所差天数作为这一结点的评价,标在边上,这里是(12,3)。按可独行能力的排序,选3~#队员支援4~#,两人共需18千克给养,差1天,评价为(18,1)。再选6~#队员支援,这时3人共需21千克给养,所差天数为0,说明这是一个成 Since the last mountaineering success, the climbing club decided to increase the difficulty, considering each member of the load and consumption of different situations. Assume that there are six members of Mountaineering Club, Mountain Height (in days): N = 6. So, who is the top candidate? Who is the first support? Who is the second support? ... From the strategy to prioritize people who can walk alone in the front row, so less need to support others. Therefore, a dynamic-delimited depth-first search strategy can be used when selecting players. First search the first tree from the left in the tree, that is, the preferred 4 ~ # players on top of the mountain up and down 12 days, a total of 12 kg for feeding; he comes with 9 kg to support, can be alone for 9 days, the third day, someone else support . We use the required number of supplies (total) and the number of days that have elapsed as the evaluation of this node, marked by the edge, here (12,3). According to the ranking of the ability to be alone, select 3 ~ # team members support 4 ~ #, a total of 18 kg for both, and poor for 1 day, as (18,1). Re-election 6 ~ # team support, then a total of 21 people need to support 3, the number of days to 0, indicating that this is a