2217.cpp

杭电 acm部分代码 有兴趣的可以下载 谢谢

#include <iostream>
#include <algorithm>
using namespace std;
int n, t, num, maxnum;
int xloc[2010];
bool cmp(int a, int b){return a < b;}
int main()
{
	int i, j, now, tp;
	while (2 == scanf("%d %d", &n, &t))
	{
		for (i = 0; i < n; i++)
		{
			scanf("%d", &xloc[i]);
		}
		xloc[n] = 0;
		sort(xloc, xloc + n + 1, cmp);
		for (i = 0; i <= n; i++)
		{
			if (xloc[i] == 0)
			{
				now = i;
				break;
			}
		}
		maxnum = 0;
		for (i = now + 1; i <= n; i++)
		{
			tp = xloc[i] - xloc[now];
			if (tp > t)
			{
				continue;
			}
			num = i - now;
			if (tp * 2 < t)
			{
				tp *= 2;
				for (j = now - 1; j >= 0; j--)
				{
					tp += xloc[j + 1] - xloc[j];
					if (tp <= t)
					{
						num++;
					}
					else 
					{	
						break;
					}
				}
				if (num > maxnum)
				{
					maxnum = num;
				}
			}
			else
			{
				if (num > maxnum)
				{
					maxnum = num;	
				}
			}
		}
		for (i = now - 1; i >= 0; i--)
		{
			tp = xloc[now] - xloc[i];
			if (tp > t)
			{
				continue;
			}
			num = now  - i;
			if (tp * 2 < t)
			{
				tp *= 2;
				for (j = now + 1; j <= n; j++)
				{
					tp += xloc[j] - xloc[j - 1];
					if (tp <= t)
					{
						num++;
					}
					else 
					{
						break;
					}
				}
				if (num > maxnum)
				{
					maxnum = num;
				}
			}
			else
			{
				if (num > maxnum)
				{
					maxnum = num;	
				}
			}	
		}
		printf("%d\n", maxnum);
	}
	return 0;	
}