
拓扑
文章平均质量分 82
J_Sure
唯苦修深思方能顿悟
展开
-
POJ-1094 Sorting It All Out
Sorting It All Out Time Limit: 1000MS Memory Limit: 10000K Description An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used原创 2014-08-06 17:11:23 · 835 阅读 · 0 评论 -
POJ-3684 Labeling Balls
Labeling Balls Time Limit: 1000MS Memory Limit: 65536K Description Windy has N balls of distinct weights from 1 unit to N units. Now he tries to label them with 1 to N in s原创 2014-08-08 11:17:44 · 904 阅读 · 0 评论 -
拓扑排序
描述: 对输入的邮箱图进行托原创 2014-08-06 10:59:43 · 766 阅读 · 0 评论 -
POJ-1128 Frame Stacking
Frame Stacking Time Limit: 1000MS Memory Limit: 10000K Description Consider the following 5 picture frames placed on an 9 x 8 array. ........ ........ ........ ........ .CCC...原创 2014-08-07 20:59:35 · 885 阅读 · 0 评论 -
POJ-2585 Window Pains
Window Pains Time Limit: 1000MS Memory Limit: 65536K Description Boudreaux likes to multitask, especially when it comes to using his computer. Never satisfied with just running原创 2014-08-07 13:43:01 · 977 阅读 · 0 评论 -
HDU-2612 Find a way
Find a way Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3725 Accepted Submission(s): 1212 Problem Description Pass a year learnin原创 2014-08-07 10:29:15 · 844 阅读 · 0 评论 -
POJ-1270 Following Orders
Following Orders Time Limit: 1000MS Memory Limit: 10000K Description Order is an important concept in mathematics and in computer science. For example, Zorn's Lemma states: ``a原创 2014-08-07 21:57:04 · 993 阅读 · 0 评论