搜索、回溯、遍历
关注
分享
扫一扫
Melicent1
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
poj2488(经典dfs)
http://poj.org/problem?id=2488A Knight's JourneyTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 20757Accepted: 7009DescriptionBackgroundThe knight is getting bored of seei原创 2013-05-30 10:52:46 · 525 阅读 · 0 评论 -
1poj2312(变化的bfs好题)
http://poj.org/problem?id=2312Battle CityTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5986Accepted: 1971DescriptionMany of us had played the game"Battle city" in our ch原创 2013-05-30 10:56:51 · 567 阅读 · 0 评论 -
1poj2386(把方向dfs||poj1562)
http://poj.org/problem?id=2386Lake CountingTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 14434Accepted: 7297DescriptionDue to recent rains, water haspooled in various pl原创 2013-05-30 10:56:55 · 525 阅读 · 0 评论 -
0.5poj1270(topo)
http://poj.org/problem?id=1270Following OrdersTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 2620Accepted: 986DescriptionOrder is an important concept inmathematics and i原创 2013-05-30 10:57:12 · 583 阅读 · 0 评论 -
0.8poj1659(Havel定理)
http://poj.org/problem?id=1659Frogs' NeighborhoodTime Limit: 5000MSMemory Limit: 10000KTotal Submissions: 4722Accepted: 2082Special JudgeDescription未名湖附近共有N个大小湖泊L1, L2,...,Ln(其原创 2013-05-30 10:57:04 · 524 阅读 · 0 评论 -
1poj1011(dfs剪枝)
http://poj.org/problem?id=1011SticksTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 99830Accepted: 22703DescriptionGeorge took sticks of the same length and cutthem random原创 2013-05-30 10:56:57 · 914 阅读 · 0 评论 -
1poj2362(dfs剪枝)
http://poj.org/problem?id=2362SquareTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 16138Accepted: 5565DescriptionGiven a set of sticks of variouslengths, is it possible t原创 2013-05-30 10:56:53 · 608 阅读 · 0 评论 -
1poj2243(bfs)
http://poj.org/problem?id=2243Knight MovesTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8713Accepted: 4999DescriptionA friend of you is doingresearch on the Traveling Kn原创 2013-05-30 10:56:49 · 634 阅读 · 0 评论 -
0.9poj1129(dfs四色问题不错)
http://poj.org/problem?id=1129Channel AllocationTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9779Accepted: 4983DescriptionWhen a radio station is broadcasting over a ver原创 2013-05-30 10:56:41 · 2074 阅读 · 0 评论 -
0.8poj1166
http://poj.org/problem?id=1166The ClocksTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 12385Accepted: 4898Description|-------| |-------| |-------|| | |原创 2013-05-30 10:57:10 · 568 阅读 · 0 评论 -
0.9poj2083(递归绘图好题)
http://poj.org/problem?id=2083FractalTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 5892Accepted: 2975DescriptionA fractal is an object orquantity that displays self-simi原创 2013-05-30 10:57:08 · 1019 阅读 · 0 评论 -
0.8poj2078(回溯||dfs)
http://poj.org/problem?id=2078MatrixTime Limit: 2000MSMemory Limit: 30000KTotal Submissions: 3022Accepted: 1561DescriptionGiven an n*n matrix A, whoseentries Ai,j are integer numbe原创 2013-05-30 10:57:06 · 744 阅读 · 0 评论 -
0.8poj1564(dfs好题啊)
http://poj.org/problem?id=1564Sum It UpTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 4658Accepted: 2354DescriptionGiven a specified total t and alist of n integers, find原创 2013-05-30 10:56:44 · 632 阅读 · 0 评论 -
1poj1111(dfs)
http://poj.org/problem?id=1111Image PerimetersTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 6527Accepted: 3867DescriptionTechnicians in a pathology labanalyze digitized原创 2013-05-30 10:56:39 · 777 阅读 · 0 评论 -
poj1562(八个方向dfs)
http://poj.org/problem?id=1562http://acm.hdu.edu.cn/showproblem.php?pid=1241这题挺经典的很多地方都出过 Oil DepositsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9447Accepted: 5177De原创 2013-05-30 10:55:43 · 732 阅读 · 0 评论 -
1poj1573(模拟题)
http://poj.org/problem?id=1573Robot MotionTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 7798Accepted: 3769DescriptionA robot has been programmed to follow the instruct原创 2013-05-30 10:53:57 · 491 阅读 · 0 评论 -
1poj1256(全排序)
http://poj.org/problem?id=1256AnagramTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 15620Accepted: 6375DescriptionYou are to write a program thathas to generate all possi原创 2013-05-30 10:57:02 · 725 阅读 · 0 评论