区间包含（贪心）

区间包含

学校 OJ 上的原题没过，计蒜客上的过了，待审查

#include <cstdio>
#include <algorithm>
#include <iostream>

using namespace std;

#define ll long long
int n, m;

struct node {
    int a, b;
} use[200100];

bool cmp(node x, node y) {
    if (x.b == y.b) {
        return x.a < y.a;
    } else {
        return x.b < y.b;
    }
}

int findR(int l, int r) {
    int left = 1, right = n;
    int mid;
    while (left < right) {
        mid = (left + right) / 2;
        if (use[mid].b == r) {
            return mid;
        } else if (use[mid].b > r) {
            right = mid - 1;
        } else {
            left = mid + 1;
        }
    }
    return mid;
}

int main() {
    while (cin >> n >> m) {
        for (int i = 1; i <= n; i++) {
//            scanf("%d%d", &use[i].a, &use[i].b);
            cin >> use[i].a >> use[i].b;
        }
        sort(use + 1, use + 1 + n, cmp);
        for (int i = 1; i <= m; i++) {
            int num = 0;
            int l, r;
//            scanf("%d%d", &l, &r);
            cin >> l >> r;
            int t = findR(l, r);
            for (int j = 1; j <= t + 1; j++) {
//                if (use[j].a > r || l == r) {
//                    break;
//                }
                if (l <= use[j].a && r >= use[j].b) {
                    num++;
                    l = use[j].b;
                }
            }
            cout << num << endl;
//            printf("%d\n", num);
        }
    }
    return 0;
}

正解

#include<iostream>
#include<algorithm>

using namespace std;
struct node {
    int a, b;
} use[110000];

bool cmp(node x, node y) {
    return x.b < y.b;
}

int main() {
    std::ios::sync_with_stdio(false);
    int m, n;
    while (cin >> m >> n) {
        for (int i = 0; i < m; i++)
            cin >> use[i].a >> use[i].b;
        sort(use, use + m, cmp);
        for (int i = 0; i < n; i++) {
            int l,r;
            cin>>l>>r;
            int num = 0;
            for (int j = 0; j < m; j++) {
                if (use[j].a >= l) {
                    if (use[j].b <= r) {
                        num++;
                        l = use[j].b;
                    } else {
                        break;
                    }
                }
            }
            cout << num << endl;
        }
    }
    return 0;
}