2012 年 5月 15 日随笔档案 - Lvpengms

2012年5月15日 #

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 阅读(283) 评论(0) 推荐(0) 编辑

{POJ}{3989}{A hard Aoshu Problem}{DFS}

摘要： 10年福州赛区的题目，暴力搜索即可。#include <iostream>#include <string>#include <cstring>#include <cstdio>#include <algorithm>#include <memory>#include <cmath>#include <bitset>#include <queue>#include <vector>#include <stack>using namespace std;#defin 阅读全文

posted @ 2012-05-15 12:58 Lvpengms 阅读(297) 评论(0) 推荐(0) 编辑

Peng Lv

导航

POJ 3988 Selecting Courses (Greedy)

{POJ}{3989}{A hard Aoshu Problem}{DFS}