【TOJ 3585】Covering the Corral【贪心】

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 100004

struct Li{
    int s, e;
    bool operator<(Li a) const {
        if (a.s == s) return e < a.e;
        return s < a.s;
    }
}l[N];

bool vis[N];
int cnt[N], r[N];

int main() {
    int c, n, i, j, ans, k;
    while (~scanf("%d%d", &c, &n)) {
        ans = n;
        for (i = 0;i < n;i++) {
            scanf("%d%d", &l[i].s, &l[i].e);
            l[i].e += l[i].s;
        }
        memset(vis, false, sizeof(vis));
        sort(l, l+n);
        int m = 0;
        for (i = 0;i < n-1;i++) if (l[i].s == l[i+1].s) vis[i] = true;
        for (i = 0;i < n;i++) {
            if (vis[i]) continue;
            for (j = i+1;j < n;j++) {
                if (l[j].s >= l[i].s && l[j].e <= l[i].e) vis[j] = true;
                if (l[j].s > l[i].e) break;
            }
        }
        for (i = 0;i < n;i++) {
            if (!vis[i]) l[m++] = l[i];
        }
        n = m;
        for (i = n-1, j = n-1;i >= 0;i--) {
            while (l[j].s > l[i].e && j > 0) j--;
            r[i] = j;
        }
        for (i = n-1;i >= 0;i--) {
            if (l[i].e < c) break;
            if (l[i].e-l[i].s >= c) {
                ans = 1;
                break;
            }
            cnt[i] = 1;
            for (j = i-1;j >= 0;j--) {
                cnt[j] = cnt[r[j]]+1;
                if (l[i].e-l[j].s >= c && ans > cnt[j]) {
                    ans = cnt[j];
                    break;
                }
            }
        }
        printf("%d\n", ans);
    }
}