该博客详细解析了POJ 1128题目的解决方案，通过拓扑排序和深度优先搜索（DFS）算法，确定由大写字母组成的方框从下到上的所有可能排列顺序。重点在于理解如何处理入度为0的框，并反向操作拓扑排序以满足题目中从下到上的字典序要求。
题目链接：http://poj.org/problem?id=1128点击打开链接
Frame Stacking
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 5646 | Accepted: 1973 |
Description
Consider the following 5 picture frames placed on an 9 x 8 array.
Now place them on top of one another starting with 1 at the bottom and ending up
........ ........ ........ ........ .CCC....
EEEEEE.. ........ ........ ..BBBB.. .C.C....
E....E.. DDDDDD.. ........ ..B..B.. .C.C....
E....E.. D....D.. ........ ..B..B.. .CCC....
E....E.. D....D.. ....AAAA ..B..B.. ........
E....E.. D....D.. ....A..A ..BBBB.. ........
E....E.. DDDDDD.. ....A..A ........ ........
E....E.. ........ ....AAAA ........ ........
EEEEEE.. ........ ........ ........ ........
1 2 3 4 5
Now place them on top of one another starting with 1 at the bottom and ending up
最低0.47元/天 解锁文章
扫一扫
2万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
