【算法】排序 入门 acoj.com

10004. 明明的随机数

解题思路

AC代码

#include <iostream>
#include <algorithm>

using namespace std;

const int MAXN = 1000000;
int n, arr[MAXN];

int main() {
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> arr[i];
    sort(arr, arr+n);
    n = unique(arr, arr+n) - arr;
    cout << n << endl;
    for (int i = 0; i < n; i++)
        cout << arr[i] << " ";
    return 0;
}

12002. 校门外的树

解题思路

AC代码

#include <iostream>

using namespace std;

const int MAXN = 10001;
int trees[MAXN];

int main() {
    int L, M, left, right;
    cin >> L >> M;
    for (int i = 0; i < M; i++) {
        cin >> left >> right;
        for (int j = left; j <= right; j++)
            if (trees[j] == 0)
                trees[j] = -1;
    }
    int res = L + 1;
    for (int i = 0; i <= L; i++)
        res += trees[i];
    cout << res;
    return 0;
}

【算法】排序 入门 acoj.com

原文：https://www.cnblogs.com/huzheyu/p/sort-rumen-acoj.html