随笔分类 -  Brute Force

5. Longest Palindromic Substring
摘要：Brutal Force: O(n^2) Manacher: O(n) 阅读全文
posted @ 2017-09-21 15:07 Weiyu Wang 阅读(146) 评论(0) 推荐(0)
POJ 1129, Channel Allocation
摘要：Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 4872Accepted: 2507DescriptionWhen a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that e... 阅读全文
posted @ 2009-10-12 02:39 Weiyu Wang 阅读(1208) 评论(0) 推荐(0)
POJ 2531, Network Saboteur
摘要：Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 3311Accepted: 1346DescriptionA university network is composed of N computers. System administrators gathered information on the traffic between... 阅读全文
posted @ 2009-10-11 10:19 Weiyu Wang 阅读(926) 评论(0) 推荐(0)
POJ 3080, Blue Jeans
摘要：brute force用第一个字符串从长到短生成所有的子串， 并和其他字符串匹配。DescriptionThe Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands o... 阅读全文
posted @ 2009-10-01 13:22 Weiyu Wang 阅读(513) 评论(0) 推荐(0)
POJ 2965, The Pilots Brothers' refrigerator
摘要：POJ 2965, The Pilots Brothers' refrigeratorPOJ 1753, Flip Game这两道题类似，可转化图论的最短路径问题：顶点（Vertex）数：65536边（Edge）数：65536 * 16 / 2边的权值（Weight）：1对于给定两个点， 求最短路径：由于边的权值均为1， 所以适宜采用BFS + Mark Table, 时间复杂度为O(N), N为... 阅读全文
posted @ 2009-09-27 10:24 Weiyu Wang 阅读(592) 评论(0) 推荐(0)
POJ 1753, Flip Game
摘要：POJ 2965, The Pilots Brothers' refrigeratorPOJ 1753, Flip Game这两道题类似，可转化图论的最短路径问题：顶点（Vertex）数：65536边（Edge）数：65536 * 16 / 2边的权值（Weight）：1对于给定两个点， 求最短路径：由于边的权值均为1， 所以适宜采用BFS + Mark Table, 时间复杂度为O(N), N为... 阅读全文
posted @ 2009-09-26 13:11 Weiyu Wang 阅读(644) 评论(0) 推荐(1)