PAT A1095

方法：排序+map的使用。

注意点：1，无效数据的处理；2，最大值对应的车牌号按字母序输出；3，处理查询的时间复杂度应低于N^2，否则会超时。

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string.h>
#include <string>
using namespace std;
const int maxn=100010;
struct record{
	int time,flag,intime,outtime;
	char plate[10];
};
vector<record> re;
int recordnum,querynum,plateindex=0,maxtime=0;
map<string,int> platetotime;
bool cmp(record a,record b){
	int s=strcmp(a.plate,b.plate);
	if(s!=0) return s<0;
	else return a.time<b.time;
}
bool cmp2(record a,record b){
	return a.intime<b.intime;
}
int main(){
	scanf("%d%d",&recordnum,&querynum);
	for(int i=0;i<recordnum;i++){
		record temp;
		char status[5];
		int th,tm,ts;
		scanf("%s%d:%d:%d%s",temp.plate,&th,&tm,&ts,status);
		temp.time=th*3600+tm*60+ts;
		if(status[0]=='i') temp.flag=0;
		else temp.flag=1;
		re.push_back(temp);
	}
	sort(re.begin(),re.end(),cmp);
	for(int i=0;i<re.size();i++){
		if(re[i].flag==1||(strcmp(re[i].plate,re[i+1].plate)!=0)||re[i+1].flag==0){
			re.erase(re.begin()+i);
			i--;
			continue;
		}
		if(re[i].flag==0&&re[i+1].flag==1){
			re[i].intime=re[i].time;
			re[i].outtime=re[i+1].time;
			re.erase(re.begin()+i+1);
		}
	}
	record nowcar=re[0];
	int nowsum=0;
	for(int i=0;i<re.size();i++){
		if(strcmp(nowcar.plate,re[i].plate)==0){
			nowsum+=(re[i].outtime-re[i].intime);
		}
		else{
			if(nowsum>maxtime) maxtime=nowsum;
			platetotime[nowcar.plate]=nowsum;
			nowsum=(re[i].outtime-re[i].intime);  //没有加号 
			nowcar=re[i];
		}
		if(i==re.size()-1){
			if(nowsum>maxtime) maxtime=nowsum;
			platetotime[nowcar.plate]=nowsum;
		}
	}
	sort(re.begin(),re.end(),cmp2);
	for(int i=0;i<querynum;i++){
		int nowtime,nowh,nowm,nows,nowcount=0;
		scanf("%d:%d:%d",&nowh,&nowm,&nows);
		nowtime=3600*nowh+60*nowm+nows;
		for(int i=0;i<re.size();i++){
			if(re[i].outtime<=nowtime) continue;
			else if(re[i].intime<=nowtime&&re[i].outtime>nowtime) nowcount++;  //
			else if(re[i].intime>nowtime) break;
		}
		printf("%d\n",nowcount);
	}
	for(map<string,int>::iterator it=platetotime.begin();it!=platetotime.end();it++){
		if(it->second==maxtime) printf("%s ",it->first.c_str());
	}
	printf("%02d:%02d:%02d",maxtime/3600,maxtime%3600/60,maxtime%60);
	return 0;
}