![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
拓扑排序
文章平均质量分 81
阿阿阿阿_欢
勿忘初心
展开
-
HDU 4324-- Triangle LOVE【拓扑排序 && 邻接表实现】
Triangle LOVETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3496 Accepted Submission(s): 1357Problem DescriptionRecently, scient原创 2015-08-14 11:48:22 · 917 阅读 · 0 评论 -
HDU 4857--逃生【拓扑排序 && 反向拓扑】
逃生Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2272 Accepted Submission(s): 640Problem Description糟糕的事情发生啦,现在大家都忙着逃命。但是逃命的通道很窄原创 2015-08-14 12:46:58 · 396 阅读 · 0 评论 -
POJ 3687--Labeling Balls【拓扑排序 && 逆序拓扑 && 输出在拓扑排序中的位置】
Labeling BallsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12251 Accepted: 3509DescriptionWindy has N balls of distinct weights from 1 unit to N un原创 2015-08-14 16:59:17 · 446 阅读 · 0 评论 -
POJ 2367 -- Genealogical tree【拓扑排序 && 水题】
Genealogical treeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3656 Accepted: 2431 Special JudgeDescriptionThe system of Martians' blood relatio原创 2015-08-14 17:17:06 · 459 阅读 · 0 评论 -
HDU 1285--确定比赛名次【拓扑排序 && 邻接表实现】
确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17134 Accepted Submission(s): 6789Problem Description有N个比赛队(1 Input原创 2015-08-14 09:59:35 · 832 阅读 · 0 评论 -
HDU 3342 -- Legal or Not【裸拓扑排序 &&水题 && 邻接表实现】
Legal or NotTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5906 Accepted Submission(s): 2734Problem DescriptionACM-DIY is a larg原创 2015-08-14 10:36:54 · 771 阅读 · 0 评论 -
HDU 2647--Reward【拓扑排序】
RewardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5636 Accepted Submission(s): 1712Problem DescriptionDandelion's uncle is a原创 2015-08-14 12:16:22 · 692 阅读 · 0 评论 -
HDU 5438 --Ponds【拓扑排序 && DFS】
题意:有N个池塘和M条连接池塘的无向管道,每个池塘都有一个价值。现在要把临近池塘数小于2的池塘全部移除(不移除管道),让你求出所有由奇数个池塘组成的连通分支,并统计它们的价值和。原创 2015-09-23 16:38:20 · 438 阅读 · 0 评论