十大题型算法全实现——（八）作业调度[2]

int reach_hour;

int reach_minite;

int need_time;

int privilege;

float excellent;

int start_time;

int wait_time;

int visited;

}job;

job jobs[MAXJOB];

int quantity;

//初始化函数

void initial()

{

int i;

for(i=;i

jobs[i].number=0;

jobs[i].reach_time=0;

jobs[i].reach_hour=0;

jobs[i].reach_minite=0;

jobs[i].privilege=0;

jobs[i].excellent=0;

jobs[i].start_time=0;

jobs[i].wait_time=0;

jobs[i].visited=0;

}

quantity=0;

}

//重置作业数据函数

void reset()

{ int i;

for(i=0;i

jobs[i].start_time=0;

[1] [2] [3] [4] [5] [6] [7] [8] [9]