07 2014 档案

hdu1010 Tempter of the Bone
摘要：转载自：http://acm.hdu.edu.cn/forum/read.php?tid=6158sample input:4 4 5S.X...X...XD....问题：(1):在发现当前节点无法到达时,这点弹出栈,并且把这点的标记重新刷为'.'(2):如何在dfs中既要保证到达又要使时间正好呢?... 阅读全文
posted @ 2014-07-19 15:07 段少 阅读(177) 评论(0) 推荐(0) 编辑
hdu 3342 Legal or Not
摘要：Problem DescriptionACM-DIY is a large QQ group where many excellent acmers get together. It is so harmonious that just like a big family. Every day,ma... 阅读全文
posted @ 2014-07-17 20:03 段少 阅读(139) 评论(0) 推荐(0) 编辑
hdu 1285 确定比赛名次
摘要：Problem Description有N个比赛队（1#include#includeint indegree[505],map[505][505];//indegree记录每个节点的入度和。map记录那些边是相关联的int tp[505],k;//记录拓扑序列。void topsort(int n... 阅读全文
posted @ 2014-07-17 17:13 段少 阅读(191) 评论(0) 推荐(0) 编辑