2490.cpp

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

/* This Code is Submitted by wywcgs for Problem 2490 on 2007-06-01 at 12:43:32 */
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 1024;

int main()
{
	int r, n, x[N];
	while(scanf("%d %d", &r, &n) != EOF && n > 0) {
		for(int i = 0; i < n; i++) scanf("%d", &x[i]);
		sort(x, x+n);
		int rx = -1 << 20, lx = -1, un = 0;
		for(int i = 0; i < n; i++)
			if(rx+r >= x[i]) continue;
			else if(lx < 0) lx = x[i];
			else if(lx+r >= x[i]) continue;
			else { rx = x[i-1]; un++; lx = -1; i--; }
		if(lx != -1) un++;
		printf("%d\n", un);
	}
	
	return 0;
}