一、题目
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.
Input
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. Each case is preceded by a blank line. There won’t be more than 1000 people and nobody takes more than 100 seconds to cross.
Output
For each test case, print a line containing the total number of seconds required for all the N people to cross the river.
Sample Input
1
4
1 2 5 10
Sample Output
17
二、思路及其代码实现
思路:贪心算法
贪心策略:
小规模开始分析:渡河时间从小到大排列:a、b、c、d、、、
(1)1人渡河:minTime = a;
(2)2人渡河:minTime = b;
(3)3人渡河:minTime = a + b + c;
(4)4人渡河:
渡法一:
a载d,a返回,a载c,a返回,a载b ——(每次最快载最慢,最快返回)
time = 2a + b + c + d
渡法二:
a载b,a返回,c载d,b返回,a载b ——(最快载二快,最快返回,最慢载二慢,二快返回,最快载二块)
time = a + 3b + d
明显:
当a + c > 2b时,渡法一快;
当a + c ≤ 2b时,渡法二快;
那么,最短渡河时间 minTime = a + b + c + min(2b,a + c)
(5)5…n人渡河
不妨循环k次,每次把两人送到对岸,使得剩余未渡河人数n-2*k≤4,此时又回到以上状态,则实现递归子问题。
渡法一送两人到对岸:每次最快载最慢,最快返回;
time = speed[remains - 1] + speed[0] + speed[remains - 2] + speed[0];
渡法二送两个到对岸:最快载二快,最快返回,最慢载二慢,二快返回;
time2 = speed[1] + speed[0] + speed[remains - 1] + speed[1];
(speed[]:从小到大排列的渡河时间数组,remains:剩余未渡河人数)
若time1 > time2:采用渡法一;
若time1 ≤ time2,采用渡法二;
/**
* 贪心
* @param n 未渡河的人数
* @param speed 渡河耗时数组(需先正序排序)
* @return
*/
public static int greedSolution(int n, int[] speed) {
int minTime = 0;