随笔分类 -  哈希

HDU 4845 拯救大兵瑞恩（分层图状压BFS）
摘要：拯救大兵瑞恩 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 264 Accepted Submission(s): 106 Problem D 阅读全文
posted @ 2017-07-21 12:27 Blackops 阅读(699) 评论(0) 推荐(0)
HDU 1043 & POJ 1077 Eight（康托展开+BFS | IDA*）
摘要：Eight Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 30176 Accepted: 13119 Special Judge Description The 15-puzzle has been around for ove 阅读全文
posted @ 2017-06-16 00:18 Blackops 阅读(310) 评论(0) 推荐(0)
SCU 4438 Censor（哈希+模拟栈）
摘要：Censor frog is now a editor to censor so-called sensitive words (敏感词). She has a long text \(p\). Her job is relatively simple -- just to find the fir 阅读全文
posted @ 2017-04-03 11:39 Blackops 阅读(506) 评论(0) 推荐(0)
SYZOJ 186 [额]你猜是不是DP（哈希+二分答案+二分搜索）
摘要：题目描述 题目描述 现在给两个仅包含小写字母的字符串a,b ，求a 与b的最长公共连续子串的长度。 现在给两个仅包含小写字母的字符串a,b ，求a 与b的最长公共连续子串的长度。 输入格式 输入格式 两个字符串 两个字符串 输出格式 输出格式 一个整数，为输入的两个字符串的最长公共连续子串的长度 一 阅读全文
posted @ 2017-04-03 11:39 Blackops 阅读(521) 评论(0) 推荐(0)
HDU 3987 Harry Potter and the Forbidden Forest（边权放大法+最小割）
摘要：Harry Potter and the Forbidden Forest Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2089 Accep 阅读全文
posted @ 2017-02-10 11:49 Blackops 阅读(415) 评论(0) 推荐(0)
POJ 2528 Mayor's posters（线段树区间染色+离散化或倒序更新）
摘要：Mayor's posters Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 59239 Accepted: 17157 Description The citizens of Bytetown, AB, could not s 阅读全文
posted @ 2016-09-16 16:46 Blackops 阅读(1226) 评论(0) 推荐(0)
HDU 1430 魔板（康托展开+BFS+预处理）
摘要：魔板 Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2921 Accepted Submission(s): 649 Problem Des 阅读全文
posted @ 2016-08-30 12:46 Blackops 阅读(622) 评论(0) 推荐(1)
HDU——2112HDU Today（SPFA+简单Hash或map+前向星）
摘要：HDU Today Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 23854 Accepted Submission(s): 5743 Pr 阅读全文
posted @ 2016-06-17 17:08 Blackops 阅读(234) 评论(0) 推荐(0)