uva 10440 Ferry Loading II

Problem B: Ferry Loading II

Before bridges were common, ferries were used to transport cars across rivers. River ferries, unlike their larger cousins, run on a guide line and are powered by the river's current. Cars drive onto the ferry from one end, the ferry crosses the river, and the cars exit from the other end of the ferry.

There is a ferry across the river that can take n cars across the river in t minutes and return in t minutes. m cars arrive at the ferry terminal by a given schedule. What is the earliest time that all the cars can be transported across the river? What is the minimum number of trips that the operator must make to deliver all cars by that time?

The first line of input contains c, the number of test cases. Each test case begins with n, t, m. m lines follow, each giving the arrival time for a car (in minutes since the beginning of the day). The operator can run the ferry whenever he or she wishes, but can take only the cars that have arrived up to that time. For each test case, output a single line with two integers: the time, in minutes since the beginning of the day, when the last car is delivered to the other side of the river, and the minimum number of trips made by the ferry to carry the cars within that time.

You may assume that 0 < n, t, m < 1440. The arrival times for each test case are in non-decreasing order.

Sample input

2
2 10 10
0
10
20
30
40
50
60
70
80
90
2 10 3
10
30
40

Output for sample input

100 5
50 2

题目意思，给定 T 组测试数据，每组测试数据如下

 船每次能装 n 辆车 ，来回需要 2*t 时间，m辆车及其到达时间。

求：在最少的次数下的时间 （最后一次不需要回头） 以及  最少的次数

用 DP可以求解 ，效率 O(n^2)

此题用贪心亦可以求解，但是不太好证明

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;

const int inf=0x3f3f3f3f;
const int maxn=1500;
int a[maxn],cnt[maxn],dp[maxn],m,time0,n;

void input(){
    scanf("%d%d%d",&m,&time0,&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    dp[0]=0;cnt[0]=0;
    for(int i=1;i<=n;i++){
        dp[i]=inf;
        cnt[i]=inf;
    }
}

void computing(){
    for(int i=0;i<=n;i++){
        for(int j=i+1;j<=min(i+m,n);j++){
            int tmp=max(dp[i],a[j])+2*time0;
            if(cnt[i]+1<=cnt[j]){
                cnt[j]=cnt[i]+1;
                if(tmp<dp[j]) dp[j]=tmp;
            }
        }
    }
    printf("%d %d\n",dp[n]-time0,cnt[n]);
}

int main(){
    int t;
    scanf("%d",&t);
    while(t-- >0){
        input();
        computing();
    }
    return 0;
}

转载于:https://www.cnblogs.com/toyking/p/3797350.html