随笔分类 -  挑战程序设计--第二章

《挑战》2.1 POJ POJ 1979 Red and Black （简单的DFS）
摘要：B - Red and BlackCrawling in process... Crawling failed Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ... 阅读全文
posted @ 2015-07-25 00:21 BYYB_0506 阅读(166) 评论(0) 推荐(0)
《挑战》2.1 POJ 2386 Lake Counting (简单的dfs)
摘要：1 # include 2 # include 3 4 using namespace std; 5 6 # define MAX 123 7 8 char grid[MAX][MAX]; 9 int nxt[8][2] = { {1,0},{0,-1},{-1,0},{0,1},{1,1}... 阅读全文
posted @ 2015-07-25 00:08 BYYB_0506 阅读(185) 评论(0) 推荐(0)