2019年7月19日
SPOJ - NSUBSTR Substrings
摘要： 题目连接： https://vjudge.net/problem/SPOJ NSUBSTR Description You are given a string S which consists of 250000 lowercase latin letters at most. We define 阅读全文
posted @ 2019-07-19 19:04 奔跑的蜗new 阅读(176) 评论(0) 推荐(0)
SPOJ-LCS2 Longest Common Substring II
摘要： 题目连接： https://vjudge.net/problem/SPOJ LCS2 Description A string is finite sequence of characters over a non empty finite set Σ. In this problem, Σ is 阅读全文
posted @ 2019-07-19 15:55 奔跑的蜗new 阅读(161) 评论(0) 推荐(0)
SPOJ-LCS Longest Common Substring
摘要： 题目连接： https://vjudge.net/problem/SPOJ LCS2 Description A string is finite sequence of characters over a non empty finite set Σ. In this problem, Σ is 阅读全文
posted @ 2019-07-19 15:26 奔跑的蜗new 阅读(187) 评论(0) 推荐(0)