p283-贪心-事件序列

#include <stdio.h>
//#define M 1000
#define N 12
void out(int select[],int n)
{
int i;
printf("{0");
for(i=1;i<n;i++)
if(select[i]==1)
printf(",%d",i);
printf("} ");
}
int main()
{
//int N,j;
//scanf("%d",&N);
//int ent[M][2];
int begin[N]={1,3,0,3,2,5,6,4,10,8,15,15};
int end[N]={3,4,7,8,9,10,12,14,15,18,19,20};
int select[N]={0};
//int select[M]={0};
//for(j=0;j<N;j++)
//scanf("%d%d",&ent[j][0],&ent[j][1]);
int i=0;
int timestart=0;
while(i<N)
{
/*if(ent[i][0]>=timestart)
{
select[i]=1;
timestart=ent[i][1];
}
i++;*/
if(begin[i]>=timestart)
{
select[i]=1;
timestart=end[i];
}
i++;
}
out(select,N);
return 0;
}