Implement a MyCalendarThree class to store your events. A new event can always be added.

Your class will have one method, book(int start, int end). Formally, this represents a booking on the half open interval [start, end), the range of real numbers x such that start <= x < end.

A K-booking happens when K events have some non-empty intersection (ie., there is some time that is common to all K events.)

For each call to the method MyCalendar.book, return an integer K representing the largest integer such that there exists a K-booking in the calendar.

Your class will be called like this: MyCalendarThree cal = new MyCalendarThree(); MyCalendarThree.book(start, end)

Example 1:

MyCalendarThree();
MyCalendarThree.book(10, 20); // returns 1
MyCalendarThree.book(50, 60); // returns 1
MyCalendarThree.book(10, 40); // returns 2
MyCalendarThree.book(5, 15); // returns 3
MyCalendarThree.book(5, 10); // returns 3
MyCalendarThree.book(25, 55); // returns 3
Explanation: 
The first two events can be booked and are disjoint, so the maximum K-booking is a 1-booking.
The third event [10, 40) intersects the first event, and the maximum K-booking is a 2-booking.
The remaining events cause the maximum K-booking to be only a 3-booking.
Note that the last event locally causes a 2-booking, but the answer is still 3 because
eg. [10, 20), [10, 40), and [5, 15) are still triple booked.

Note:

The number of calls to MyCalendarThree.book per test case will be at most 400.
In calls to MyCalendarThree.book(start, end), start and end are integers in the range [0, 10^9].

思路:本題是要求出當(dāng)前并發(fā)的日期區(qū)間的最大值,即下圖中最多有多少個(gè)重疊段.
例如:第五次操作調(diào)用MyCalendarThree.book(5, 10);
[5,10)與[5,15)是兩個(gè)重疊段,然而為何返回3呢?往上看,[5,15),[10,40)與[10,20)是三個(gè)重疊段.
我們可以在timeline中記錄每個(gè)事件的start和end,每個(gè)start表示在這個(gè)時(shí)間點(diǎn)增加了一個(gè)事件(++),每個(gè)end表示在此刻結(jié)束了一個(gè)事件(--).將他們記錄在map中,key為時(shí)間點(diǎn),value為事件數(shù).
這里用到map的重要特性:map中記錄是按key值排序的.
因此求多少段重疊,只需遍歷map,將每個(gè)時(shí)刻的事件數(shù)求和,最后記錄下這個(gè)過程中事件數(shù)最大值是多少即可.

IMG_7170.jpg

class MyCalendarThree {
public:
    int book(int start, int end) {
        timeline[start]++;  //一個(gè)新事件在[start]處開始(首次調(diào)用 operator[] 以零初始化value域)
        timeline[end]--;  //一個(gè)新事件在[end]處結(jié)束
        int max = 0, ongoing = 0;
        for (pair<int, int> t : timeline) {
            ongoing += t.second;  //記錄正在進(jìn)行的事件數(shù)
            if (ongoing > max) max = ongoing;  //記錄事件數(shù)最大值
        }
        return max;
    }
private:
    map<int, int> timeline;
};