拓扑排序
关注
分享
扫一扫
文章平均质量分 75
Rechard_chen
不积跬步无以至千里。
展开
-
Ordering Tasks
DescriptionJohn has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task is only possible if other tasks have already been executed.InputThe input wi原创 2014-12-17 19:25:42 · 729 阅读 · 0 评论 -
HDU-1285-拓扑排序-确定比赛名次
点击打开题目链接# include # include # include # include # include # include using namespace std;const int maxn = 500 + 5;vector g[maxn];int n,m,du[maxn],l[maxn];void topsort(){ int tot原创 2015-08-07 09:33:22 · 702 阅读 · 0 评论