贪心

1、CSU 1751 卡牌通行证

解题思路：按 b 进行排序后贪心

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cctype>
#include <ctime>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)

typedef long long ll;
typedef pair<int, int> Pair;
int T, n, a, b;

const int INF = 0x7fffffff;

int main() {
#ifdef __AiR_H
    freopen("in.txt", "r", stdin);
#endif // __AiR_H
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        vector<Pair> v;
        REP(i, n) { scanf("%d %d", &a, &b); v.push_back(make_pair(b, a)); }
        sort(v.begin(), v.end());
        int ans = 1, t = v[0].first;
        for (int i = 1; i < n; ++i) { if (v[i].second > t) { t = v[i].first; ++ans; } }
        printf("%d\n", ans);
    }
#ifdef __AiR_H
    printf("Time used = %.2fs\n", (double)clock() / CLOCKS_PER_SEC);
#endif // __AiR_H
    return 0;
}

2、51Nod 1091 线段的重叠

解题思路：

按s进行排序，记录最大的e

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cctype>
#include <ctime>
#include <cassert>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define eps 1e-9

typedef long long ll;
typedef pair<int, int> pii;

const int INF = 0x7fffffff;
vector<pii> v;
int N, s, e;

int main() {
#ifdef __AiR_H
    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
#endif // __AiR_H
    scanf("%d", &N);
    REP(i, N) { scanf("%d %d", &s, &e); v.push_back(make_pair(s, e)); }
    sort(v.begin(), v.end());
    int last = v[0].second, ans = 0;
    for (int i = 1; i < N; ++i) {
        if (v[i].second < last) { ans = max(ans, v[i].second - v[i].first); }
        else { ans = max(ans, last - v[i].first); last = v[i].second; }
    }
    printf("%d\n", ans);
#ifdef __AiR_H
    printf("Time used = %.2fs\n", (double)clock() / CLOCKS_PER_SEC);
#endif // __AiR_H
    return 0;
}