地毯长度n，地毯个数k，地毯长度[1, n]
只能找到时间复杂度O(kn)的算法。但就有那么几条是超时的。

#include <iostream>
using namespace std;

int main()
{
    int n, k, begin, end;
    int floors[100000];
    cin >> n >> k;
    for (int i = 0; i < n; ++i) {
        floors[i] = 0;
    }
    for (int i = 0; i < k; ++i) {
        cin >> begin >> end;
        for (int j = begin; j < end; ++j) {
            ++floors[j];
        }
    }
    for (int i = 0; i < n; ++i) {
        cout << floors[i] << " ";
    }
    return 0;
}

--
修改:Maxwin FROM 101.229.90.*
FROM 101.229.90.*