拓扑排序
life4711
这个作者很懒,什么都没留下…
展开
-
hdu 1285 拓扑排序
http://acm.hdu.edu.cn/showproblem.php?pid=1285 Problem Description 有N个比赛队(1 Input 输入有若干组,每组中的第一行为二个数N(1 Output 给出一个符合要求的排名。输出时队伍号之间有空格,最后一名后面没有空格。 其他说明:符合条件的排名原创 2014-04-23 07:11:02 · 734 阅读 · 0 评论 -
poj1094 拓扑排序
http://poj.org/problem?id=1094 Description An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to larges原创 2015-01-25 19:27:23 · 1082 阅读 · 0 评论 -
拓扑排序
Description The system of Martians' blood relations is confusing enough. Actually, Martians bud when they want and where they want. They gather together in different groups, so that a Martian can原创 2014-04-28 21:32:51 · 986 阅读 · 0 评论 -
hdu 2467 拓扑排序之反向建图
http://acm.hdu.edu.cn/showproblem.php?pid=2647 Problem Description Dandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. N原创 2014-04-23 16:46:42 · 1427 阅读 · 0 评论 -
UVALive 4255 拓扑排序
http://vjudge.net/contest/view.action?cid=48251#problem/B原创 2014-06-27 18:51:23 · 898 阅读 · 0 评论 -
hdu 2094 图的拓扑排序
http://acm.hdu.edu.cn/showproblem.php?pid=2094 Problem Description 有一群人,打乒乓球比赛,两两捉对撕杀,每两个人之间最多打一场比赛。 球赛的规则如下: 如果A打败了B,B又打败了C,而A与C之间没有进行过比赛,那么就认定,A一定能打败C。 如果A打败了B,B又打败了C,而且,C又打败了A,那么A、B、C三者都原创 2014-04-22 09:58:42 · 725 阅读 · 0 评论 -
hdu5222 拓扑+并查集
http://acm.hdu.edu.cn/showproblem.php?pid=5222 Problem Description Miceren likes exploration and he found a huge labyrinth underground! This labyrinth has N caves and some tunnels connec原创 2015-05-09 21:52:08 · 1045 阅读 · 0 评论 -
拓扑排序模板
#include #include #include #include #include using namespace std; const int maxn=30; int head[maxn],ip,indegree[maxn]; int n,m,seq[maxn]; struct note { int v,next; } edge[maxn*maxn]; void原创 2015-01-25 19:55:25 · 4479 阅读 · 2 评论