会场安排问题:做完之后发现答案很简单,很气,但还是把自己写的贴上来。
#include<iostream>
#include<algorithm>
using namespace std;
void Put(int n,int start[],int end[],int mark[],int space[]){
for(int i=0;i<n;i++)
{
space[i] = 0;
mark[i] = 0;
}
int count=0;
for( int i=0;i<n;i++){
cout<<"count= "<<count<<endl;
cout<<"会场当前结束时间: ";
for(int k=0;k<=count;k++)
cout<<space[k]<<" ";
sort(space,space+count+1);
cout<<"\n会场当前结束时间排序后: ";
for(int k=0;k<=count;k++)
cout<<space[k]<<" ";
cout<<endl;
for(int j=0;j<=count;j++){
if(start[i] > space[j]){
mark[i] = 1;
space[j] = end[i];
cout<<"end["<<i<<"] = "<<end[i]<<" space[ "<<j<<"]= "<<space[j]<<endl;
break;
}
}
if(mark[i] !=1) {
count++;
space[cou