Description
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
思路:
情况一:当有1个人a的时候,时间为t[a];
情况二:当有2个人a,b(a<=b)的时候,时间为t[b];
情况三:当有3个人a,b(a<=b<=c)的时候,时间为t[a]+t[b]+t[c];
情况四:当有n(n>3)个人的时候,假设a、b是过河所需时间最少的两个人(a<=b),y、z是过河所需时间最长的两个人(y<=z),每次送两个人过河有两种选择方案:
1)先将a、b一起送过河,a回来,y、z过河,b回来,时间为t[b]+t[a]+t[z]+t[b];
2)先将a、d一起送过河,a回来,a、c过河,a回来,时间位t[z]+t[a]+t[x]+t[a];
当n为奇数时,由情况四逐步运送两个时间最长的人过河,最后总会到达情况三,当n为偶数时,由情况四逐步运送两个时间最长的人过河,最后总会到达情况二。
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
vector <int> a;
int n, m, i,sum = 0;
cin>>n;
for(i = 1; i <= n; i++)
{
cin>>m;
a.push_back(m);
}
sort(a.begin(), a.end());
a.insert(a.begin(), 0);
while(1)
{
if(n == 1)
{
sum += a[1];
break;
}
else if(n == 2)
{
sum += a[2];
break;
}
else if(n == 3)
{
sum += (a[1] + a[2] + a[3]);
break;
}
else
{
sum += min(2*a[2] + a[1] + a[n], a[n] + 2*a[1] + a[n-1]);
a.erase(a.end()-1, a.end());
n -= 2;
}
}
cout<<sum<<endl;
}
return 0;
}