Cars on Campus

 这个dp很头疼，参考了https://www.liuchuo.net/archives/2951大佬思路

#include<bits/stdc++.h>
using namespace std;
struct Node{
	string id;
	int timelen;
	int status;
};
bool cmp(Node a,Node b){
	if(a.id!=b.id) return a.id<b.id;
	else return a.timelen<b.timelen;
}
bool cmp1(Node a,Node b){
	return a.timelen<b.timelen;
}
int main()
{
	freopen("in.txt","r",stdin);
	int n,k;cin>>n>>k;
	vector<Node> ppp;
	for(int i=0;i<n;i++){
		Node temp;
		string _id,_statuss;
		int _h,_m,_s;
		cin>>_id;
		scanf("%d:%d:%d",&_h,&_m,&_s);
		cin>>_statuss;
		temp.id=_id;
		if(_statuss=="in"){
			temp.status=1;
		}else temp.status=-1;
		temp.timelen=_h*3600+_m*60+_s;
		ppp.push_back(temp);
	}
	sort(ppp.begin(),ppp.end(),cmp);
	vector<Node> sh;
	vector<string> maxlen;
	int maxtime=-1;
	map<string,int> totaltime;
	for(int i=0;i<ppp.size()-1;i++){
		if(ppp[i].status==1&&ppp[i+1].status==-1&&(ppp[i].id==ppp[i+1].id)){
			sh.push_back(ppp[i]);
			sh.push_back(ppp[i+1]);
			totaltime[ppp[i].id]+=ppp[i+1].timelen-ppp[i].timelen;
		}
	}
	for(auto it=totaltime.begin();it!=totaltime.end();it++){
		if(it->second>maxtime){
				maxlen.clear();
				maxtime=it->second;
				maxlen.push_back(it->first);
		}else if(it->second==maxtime){
				maxlen.push_back(it->first);
		}
	}
	sort(sh.begin(),sh.end(),cmp1);
	int ans[n]={};
	for(int i=0;i<sh.size();i++){
		if(i==0){
			ans[i]+=sh[i].status;
		}else{
			ans[i]=ans[i-1]+sh[i].status;
		}
	}
	int tempindex=0;
	for(int i=0;i<k;i++){
		int p1,p2,p3;
		scanf("%d:%d:%d",&p1,&p2,&p3);
		int ti=p1*3600+p2*60+p3;
		int j;
		for(j=tempindex;j<sh.size();j++){
			if(sh[j].timelen>ti){
				cout<<ans[j-1]<<endl;break;
			}else{
				if(j==sh.size()-1){
					cout<<ans[j]<<endl;
				}
			}
		}
		tempindex=j;
	} 
	for(int i=0;i<maxlen.size();i++){
		cout<<maxlen[i]<<' ';
	}
	int t1,t2,t3;
	t1=maxtime/3600,t2=maxtime%3600/60,t3=maxtime%3600%60;
	printf("%02d:%02d:%02d\n",t1,t2,t3);
	return 0;
}
 

 下面是自己写的超时代码（27分），与上面代码相比，主要就是dp数组的差别~

#include<bits/stdc++.h>
using namespace std;
struct Node{
	string id;
	int timelen;
	int status;
};
bool cmp(Node a,Node b){
	if(a.id!=b.id) return a.id<b.id;
	else return a.timelen<b.timelen;
}
int main()
{
	freopen("in.txt","r",stdin);
	int n,k;cin>>n>>k;
	vector<Node> ppp;
	for(int i=0;i<n;i++){
		Node temp;
		string _id,_statuss;
		int _h,_m,_s;
		cin>>_id;
		scanf("%d:%d:%d",&_h,&_m,&_s);
		cin>>_statuss;
		temp.id=_id;
		if(_statuss=="in"){
			temp.status=1;
		}else temp.status=-1;
		temp.timelen=_h*3600+_m*60+_s;
		ppp.push_back(temp);
	}
	sort(ppp.begin(),ppp.end(),cmp);
	vector<Node> sh;
	vector<string> maxlen;
	int maxtime=-1;
	map<string,int> totaltime;
	for(int i=0;i<ppp.size()-1;i++){
		if(ppp[i].status==1&&ppp[i+1].status==-1&&(ppp[i].id==ppp[i+1].id)){
			sh.push_back(ppp[i]);
			sh.push_back(ppp[i+1]);
			totaltime[ppp[i].id]+=ppp[i+1].timelen-ppp[i].timelen;
		}
	}
	for(auto it=totaltime.begin();it!=totaltime.end();it++){
		if(it->second>maxtime){
				maxlen.clear();
				maxtime=it->second;
				maxlen.push_back(it->first);
		}else if(it->second==maxtime){
				maxlen.push_back(it->first);
		}
	}
	for(int i=0;i<k;i++){
		int p1,p2,p3;
		scanf("%d:%d:%d",&p1,&p2,&p3);
		int ti=p1*3600+p2*60+p3;
		int cnt=0;
		for(int j=0;j<sh.size()-1;j+=2){
			if(sh[j].timelen<=ti&&sh[j+1].timelen>ti){
				cnt++;
			}
		}
		cout<<cnt<<endl;
	} 
	for(int i=0;i<maxlen.size();i++){
		cout<<maxlen[i]<<' ';
	}
	int t1,t2,t3;
	t1=maxtime/3600,t2=maxtime%3600/60,t3=maxtime%3600%60;
	printf("%02d:%02d:%02d\n",t1,t2,t3);
	return 0;
}