HDU4150-字符串匹配－WA之路

Raise

于 2014-01-29 14:58:27 发布

阅读量1.6k

点赞数

分类专栏： C++ ACM 算法分析与设计文章标签： acm 算法

本文链接：https://blog.csdn.net/linraise/article/details/18862797

版权

本文探讨了HDU4150题目的字符串匹配问题，分析了造成WA（Wrong Answer）的原因，并提供了解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Powerful Incantation

Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 1072 Accepted Submission(s): 470

Problem Description

Some dangerous Witches invaded the garden city! As a righteous magician, james0zan want to find the most powerful incantation so he can beat those dangerous witches easily.
After consulted one hundred and eight thousand Magic Books, james0zan find a way to calculate the power of an incantation. There is a very short incantation called “magic index” which contains the magic power, and each incantation’s power can be calculated by the times the “magic index” appearance in the incantation. Notice that if two “magic index” overlapped, the power only should be calculated once. And we just want the incantation more powerful. That is to say, if the “magic index” is “aa”, the power of incantation “aaaa”