摘要: NSUBSTR - Substringsno tagsYou are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of ... 阅读全文
posted @ 2015-08-14 18:53 狂徒归来 阅读(273) 评论(0) 推荐(0) 编辑
摘要: LCS - Longest Common SubstringA string is finite sequence of characters over a non-empty finite set Σ.In this problem, Σ is the set of lowercase lette... 阅读全文
posted @ 2015-08-14 16:06 狂徒归来 阅读(242) 评论(0) 推荐(0) 编辑
摘要: SegmentsTime Limit: 2000msMemory Limit: 10000KBThis problem will be judged onACdream. Original ID:115764-bit integer IO format:%lld Java class name:(N... 阅读全文
posted @ 2015-08-14 15:30 狂徒归来 阅读(176) 评论(0) 推荐(0) 编辑
摘要: Saving BeansTime Limit: 3000msMemory Limit: 32768KBThis problem will be judged onHDU. Original ID:303764-bit integer IO format:%I64d Java class name:M... 阅读全文
posted @ 2015-08-14 11:10 狂徒归来 阅读(191) 评论(0) 推荐(0) 编辑
摘要: DanganronpaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 318Accepted Submission(s): 176Problem... 阅读全文
posted @ 2015-08-14 10:50 狂徒归来 阅读(228) 评论(0) 推荐(0) 编辑