1965.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1965 on 2006-01-11 at 18:48:27 */ 
#include <cstdio>
#include <cassert>
#include <algorithm>
using namespace std;

const int MAX = 1440;

int main()
{
	int fn, time, m, n, car[MAX];
	int t, T, i, j;

	scanf("%d", &T);
	for(t = 0; t < T; t++) {
		scanf("%d %d %d", &n, &time, &m);
		fn = (m+n-1) / n;
		int r = m - (fn-1)*n;
		for(i = 0; i < r; i++) scanf("%d", &car[0]);
		for(i = 1; i < fn; i++)
			for(j = 0; j < n; j++) scanf("%d", &car[i]);
		for(i = 1; i < fn; i++) car[i] = max(car[i], car[i-1]+time*2);
		printf("%d %d\n", car[fn-1]+time, fn);
	}
	
	return 0;
}