拓扑排序
文章平均质量分 88
非常可乐(이녕)
贵在自知,贵在坚持
展开
-
POJ 2367 Genealogical tree 【拓扑 基础题】
Genealogical treeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3718 Accepted: 2474 Special JudgeDescriptionThe system of Martians' blood relations i原创 2015-08-18 21:16:12 · 483 阅读 · 0 评论 -
POJ 2585 Window Pains【拓扑】
Window PainsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1778 Accepted: 894DescriptionBoudreaux likes to multitask, especially when it comes to using h原创 2015-08-18 11:51:21 · 727 阅读 · 0 评论 -
hdu 1285 确定比赛名次【拓扑】
确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17065 Accepted Submission(s): 6757Problem Description有N个比赛队(1 Input原创 2015-08-11 21:46:35 · 369 阅读 · 0 评论 -
HDU 4324 Triangle LOVE 【拓扑排序】
Triangle LOVETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3494 Accepted Submission(s): 1356Problem DescriptionRecently, scie原创 2015-08-14 10:48:14 · 427 阅读 · 0 评论 -
HDU 2647 Reward 【逆拓扑】
RewardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5633 Accepted Submission(s): 1710Problem DescriptionDandelion's uncle is原创 2015-08-14 12:00:52 · 345 阅读 · 0 评论 -
HDU 5154 Harry and Magical Computer【逆拓扑】
#include #include#include#includeusing namespace std;int n,cnt,in[110],head[110];struct node{ int a,b,next;};node edge[10010];void add(int a,int b){ edge[cnt].a=a;原创 2015-08-17 09:36:12 · 431 阅读 · 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): 5904 Accepted Submission(s): 2732Problem DescriptionACM-DIY is a la原创 2015-08-14 09:42:32 · 393 阅读 · 0 评论 -
HDU 4857 逃生 【逆拓扑 优先队列】
逃生Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2329 Accepted Submission(s): 656Problem Description糟糕的事情发生啦,现在大家都忙着逃命。但是逃命的通道原创 2015-08-14 19:23:12 · 442 阅读 · 0 评论 -
POJ 1094 Sorting It All Out【拓扑 邻接表 邻接矩阵 唯一确定顺序】
Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 30236 Accepted: 10467DescriptionAn ascending sorted sequence of distinct values is one i原创 2015-08-18 20:44:25 · 732 阅读 · 0 评论 -
POJ 3687 Labeling Balls 【逆拓扑】
Labeling BallsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12304 Accepted: 3527DescriptionWindy has N balls of distinct weights from 1 unit to N un原创 2015-08-19 10:14:16 · 378 阅读 · 0 评论 -
拓扑排序
拓扑排序: 操作对象是一个有向无环图(一个从某顶点出发警官若干条边无法回到该点的有向图)。就是将图中所有顶点排成一个线性序列,使得图中任意一对顶点u 和v ,若图中存在一条这样的边从u 到v ,则在线性序列中u 要出现在v 之前。生成这样序列的过程为拓扑排序。例如下图中的选课要求所谓拓扑序列就是图中要求要学习C3就必须先学习C1和C2那么排序时C1和C2就必须在C3的前原创 2015-10-27 16:28:44 · 437 阅读 · 0 评论