2014年4月7日
题目2 : Longest Repeated Sequence
摘要： 时间限制:10000ms单点时限:1000ms内存限制:256MB描述You are given a sequence of integers, A = a1, a2, ... an. A consecutive subsequence of A (say ai, ai+1 ... aj) is called a "repeated sequence" if it appears more than once in A (there exists some positive k that ai+k = ai, ai+k+1 = ai+1, ... aj+k = aj) an 阅读全文
posted @ 2014-04-07 15:03 Shanks-香克斯 阅读(163) 评论(0) 推荐(0)