POJ 3988 Selecting Courses (Greedy)
摘要:
{POJ} {3988} {Selecting courses}Greedy Algorithm, time is fixed and just find the earlest finished courses.#include <iostream>#include <string>#include <cmath>#include <cstdio>#include <cstring>#include <cstdlib>#include <ctime>#include <queue>#include 阅读全文
posted @ 2012-05-15 13:01 Lvpengms 阅读(284) 评论(0) 推荐(0) 编辑