poj3069 Saruman‘s Army

贪心题，首先把题意读懂，然后就是操作，先找当前未被包含在内点，然后去找它右边最远的范围内的点，模拟写好即可，

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <string>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>

#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

int main() {
    int r, n;
    while (cin >> r >> n && r != -1) {
        int a[1005];
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        sort(a, a + n);
        int i = 0;
        int ans = 0;
        while (i < n) {
            int s = a[i++];
            while (i < n && s + r >= a[i]) {
                i++;
            }
            int p = a[i - 1];
            while (i < n && p + r >= a[i]) {
                i++;
            }
            ans++;
        }
        cout << ans << endl;
    }
    return 0;
}