POJ 3069 Saruman‘s Army 贪心

#include <iostream>
#include <algorithm>
using namespace std;
int x[1007], R, n;
void input()
{
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &x[i]);
    }
    sort(x + 1, x + 1 + n);
}
void solve()
{
    int right = -1, ans = 0;
    for (int i = 1; i <= n; i++)
    {
        if (x[i] <= right)
        {
            continue;
        }
        ans++;
        int center = i;
        for (int j = i + 1; j <= n; j++)
        {
            if (x[i] + R >= x[j])
            {
                center = j;
            }
            else
            {
                break;
            }
        }
        right = x[center] + R;
    }
    printf("%d\n", ans);
}
int main()
{
    while (true)
    {
        scanf("%d%d", &R, &n);
        if (R == -1 && n == -1)
        {
            break;
        }
        else
        {
            input();
            solve();
        }
    }
    return 0;
}