[贪心] hdu2037 今年暑假不AC （区间之选择不相交区间）

题目

hdu2037

思路

代码

#include "stdafx.h"
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn = 1000;
//struct qujian A[maxn];
int n;
bool beizhan[maxn];

struct qujian {
    int a, b;
    bool operator < ( const qujian &rhs) const {
        return b < rhs.b;
    }
}A[maxn];

int main() {
    while (scanf("%d", &n) == 1 && n) {
        for (int i = 0; i < n; i++) scanf("%d%d", &A[i].a, &A[i].b);
        sort(A, A + n);
        memset(beizhan, 0, sizeof(beizhan));
        int ans = 0;
        for (int i = 0; i < n; i++) {
            if (beizhan[i]) continue;
            ans++;
            int x = i+1;
            while (A[i].b > A[x].a) {
                beizhan[x] = true; x++;
            }
        }
        printf("%d\n", ans);
    }
    system("PAUSE");
    return 0;
}

收获

1.贪心好强啊
2.这题好水啊
3.电脑没电了啊