POJ 1700 过河问题(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

• 查看
• 提交
• 统计
• 提示
• 提问

//贪心法
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

int T, num, cost[1010];

int main()
{
    scanf("%d",&T);
    while(T--)
    {
        int totTime = 0;
        scanf("%d",&num);
        for(int i=0;i<num;i++)
            scanf("%d",&cost[i]);
        while(num >= 4)
        {
            if(2*cost[0]+cost[num-1]+cost[num-2] < 2*cost[1]+cost[0]+cost[num-1])
                totTime += (2*cost[0]+cost[num-1]+cost[num-2]);//最快的那个分别送最慢的两个人过去，自己再回来
            else
                totTime += (2*cost[1]+cost[0]+cost[num-1]);//最快的和次快的过去，最快的回来，最慢的两个一起过去，次快的回来。
            num -= 2;
        }
        if(num == 3)
            totTime += (cost[0]+cost[1]+cost[2]);
        else if(num == 2)
            totTime += cost[1];
        else
            totTime += cost[0];
        printf("%d\n",totTime);
    }
    return 0;
}