PAT A1095 Cars on Campus (30)

解题思路：

题目要求能查找随机时刻在校内的所有车辆数量，如果遍历所有记录会超时，所以要另外记录有效的数据（即相邻的in和out记录）。
首先将所有数据按照id和进出时刻排序，然后遍历鉴别有效记录并计算出时间，时间通过map<string, int>映射记录。同时也顺便记录最长时间。
然后进行查询，将有效记录以时间排序，然后依次读入查询时间，小于查询时间的记录，若是in则在校车辆数+1，否则-1。
要注意一点是，题设给出查询时间序列是递增的，可以利用这点，从上次查询时间后再开始查询，逐步缩小查询范围。否则可能超时。

AC代码

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <string>
#include <math.h>
using namespace std;
const int maxn = 10010, maxk = 80010;
struct Record {
    char plate_number[9];
    int length;
    bool incampus;
} record[maxn], valid[maxn];
map<string, int> mp;

bool cmp(Record a, Record b) {
    int l = strcmp(a.plate_number, b.plate_number);
    if (l != 0) return l > 0;
    else return a.length < b.length;
}
bool cmpByTime(Record a, Record b) {
    return a.length < b.length;
}
int time(int hh, int mm, int ss) {
    return hh * 3600 + mm * 60 + ss;
}

int main() {
    int n, k, i, j, h, m, s;
    char status[3];
    scanf("%d%d\n", &n, &k);

    for ( i = 0; i < n; i++)
    {
        scanf("%s", record[i].plate_number);
        scanf("%d:%d:%d", &h, &m, &s);
        scanf("%s\n", status);
        if (strcmp(status, "in") == 0)
            record[i].incampus = true;
        else
            record[i].incampus = false;
        record[i].length = time(h, m, s);
    }

    sort(record, record + n, cmp);

    int lastT = record[0].length, maxT = -1, validn = 0;
    bool laststatus = record[0].incampus;
    for ( i = 1; i < n; i++)
    {
        j = strcmp(record[i].plate_number, record[i - 1].plate_number);
        if (j == 0) {       // 上下是同一辆车的记录
            if (laststatus && !record[i].incampus) {
                valid[validn++] = record[i-1];
                valid[validn++] = record[i];
                if (mp.count(record[i].plate_number) == 0)
                    mp[record[i].plate_number] = 0;
                mp[record[i].plate_number] += record[i].length - lastT;
                maxT = max(maxT, mp[record[i].plate_number]);
            }
        }
        // 记录last数据
        lastT = record[i].length;
        laststatus = record[i].incampus;
    }

    sort(valid, valid + validn, cmpByTime);
    int now = 0, numCar = 0, t;     // now用来记录不超过当前查询时间的记录
    for ( i = 0; i < k; i++)
    {
        scanf("%d:%d:%d", &h, &m, &s);
        t = time(h, m, s);
        while (now < validn && valid[now].length <= t)
        {
            if (valid[now].incampus)
                numCar++;
            else
                numCar--;
            now++;
        }
        printf("%d\n", numCar);
    }

    map<string, int>::iterator it;
    for (it = mp.begin(); it != mp.end(); it++)
    {
        if (it->second == maxT)
            printf("%s ", it->first.c_str());
    }
    printf("%02d:%02d:%02d", maxT/3600, maxT%3600/60, maxT%60);

    return 0;
}
//for ( i = 0; i < n; i++)
//{
//  printf("%s", record[i].plate_number);
//  printf("  %d  ", record[i].length);
//  if (record[i].incampus)
//  {
//      printf("in\n");
//  }
//  else
//      printf("out\n");
//}