string
文章平均质量分 88
Geterns
这个作者很懒,什么都没留下…
展开
-
SCUT J.O: 最大公共子串
最大公共子串<br />Time Limit:<br />1000MS Memory Limit:<br />10000KDescription<br />从一个给定的串中删去(不一定连续地删去)0个或0个以上的字符,剩下的字符按原来顺序组成的串是该串的子串。例如:“”,“a”,“xb”,“aaa”,“bbb”,“xabb”,“xaaabbb”都是串“xaaabbb”的子串。(例子中的串不包含引号。) <br />编程求N个非空串的最长公共子串的长度。限制:2≤N≤100;N个串中的字符只会是数字0,1,…原创 2010-12-02 01:44:00 · 279 阅读 · 0 评论 -
SCUT J.O: Substring
SubstringTime Limit:1000MS Memory Limit:10000KDescriptionDr lee cuts a string S into N pieces, s[1],…,s[N].Now, Dr lee gives you these N sub-strings: s[1],…,s[N]. There might be several possibilities that the string S could be. For example, if Dr. lee give原创 2010-12-08 17:33:00 · 263 阅读 · 0 评论 -
USACO: Contact
Contact<br />IOI'98<br />The cows have developed a new interest in scanning the universe outside their farm with radiotelescopes. Recently, they noticed a very curious microwave pulsing emission sent right from the centre of the galaxy. They wish to know i原创 2010-12-22 00:46:00 · 469 阅读 · 0 评论