3020634_ac_0ms_148k.c

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>

int main()
{
	int n, m, t;
	int i, cas, ans;
	int ar[1441];

	scanf("%d",&cas);
	while(cas--)
	{
		scanf("%d%d%d",&n,&t,&m);
		for(i = 0; i < m; i++)
		{
			scanf("%d",&ar[i]);
		}
		if(m%n)
		{
			ans = ar[m%n-1]+2*t;
		}
		for(i = n-1+m%n; i < m; i += n)
		{
			if(i == n-1)
			{
				ans = ar[i]+2*t;
				continue;
			}
			if(ar[i] <= ans)
			{
				ans += 2*t;
			}
			else
			{
				ans = ar[i]+2*t;
			}
		}
		ans -= t;
		printf("%d %d\n",ans,m/n+(m%n!=0));
	}
	return 0;
}