当前位置： 移动技术网 > IT编程>开发语言>C/C++ > poj1700 Crossing River的相关内容介绍

poj1700 Crossing River的相关内容介绍

2018年03月31日  | 移动技术网IT编程  | 我要评论

原木价格,变奏荷尔蒙,大同汽车站

Crossing River

 

Time Limit:1000MS   Memory Limit:10000K
Total Submissions:12585   Accepted:4787

 

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

Source

 


 

题意：n个人一条船，所有人要过河；船每次只能载两个人，用时按最慢的算；求所有人过河的最小时间。

 

分析：两种情况；设最小的和第二小的为m1,m2，当前 
#include 
#include 
#include 
#include 
#include 
#include
#include 
#include 
#include 
#include 
using namespace std;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int MOD = 1000000007;
#define ll long long
#define CL(a,b) memset(a,b,sizeof(a))
#define MAXN 100010

int T,n;
int a[1010];
int sum;

int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        CL(a, 0);
        for(int i=0; i1; i-=2)
        {
            if(m2*2

最大的和第二大的为n1,n2；

 

1、m2+m2<>< p=""> 2、m2+m2>m1+n2；m1和n1先过河，然后m1回来，m1和n2过河，m1回来；

 

另外还要注意奇数的情况。

 


 


 

 

<>

您可能感兴趣的文章:

如对本文有疑问，请在下面进行留言讨论，广大热心网友会与你互动！！ 点击进行留言回复

相关文章:

验证码：
最近更新的文章
大家感兴趣的文章
移动技术网