OpenJudge

05:Crossing River

总时间限制:
1000ms
内存限制:
65536kB
描述
A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arranged in order to row the boat back and forth so that all people may cross. Each person has a different rowing speed; the speed of a couple is determined by the speed of the slower one. Your job is to determine a strategy that minimizes the time for these people to get across.
输入
The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. The first line of each case contains N, and the second line contains N integers giving the time for each people to cross the river. There won't be more than 1000 people and nobody takes more than 100 seconds to cross.
输出
For each test case, print a line containing the total number of seconds required for all the N people to cross the river.
样例输入
1
4
1 2 5 10
样例输出
17
来源
POJ Monthly--2004.07.18

01 可改变的邻接矩阵问题<思考BFS的决策>
02 遍历 <注意:大数连接的问题>
03 哈希表<注意不存在的情况>
04 栈<注意0的情况>
05 贪心<注意量变化>

全局题号
702
添加于
2016-09-07
提交次数
13
尝试人数
4
通过人数
3