## 标签 - SPOJ

? 解题记录 ? ? SPOJ ? ? 亚线性筛 ?    2020-09-23 08:18:19    786    0    0

? 解题记录 ? ? SPOJ ? ? 亚线性筛 ?    2020-09-23 08:18:17    546    0    0

? 解题记录 ? ? SPOJ ? ? 原根 ?    2018-12-19 11:24:41    430    0    0

? 解题记录 ? ? SPOJ ? ? 后缀数组 ?    2018-12-05 23:04:22    441    0    0

? 解题记录 ? ? SPOJ ? ? 后缀数组 ?    2017-12-09 16:09:16    350    0    0
Given a string, we need to find the total number of its distinct substrings. InputT- number of test cases. T<=20; Each test case consists of one string, whose length is <= 1000 OutputFor each test case output one number saying the number of distinct substrings. ExampleSample Input: 2 CCCCC ABA
? 解题记录 ? ? SPOJ ? ? 后缀自动机 ? ? 动态规划 ?    2017-10-01 12:59:43    411    0    0
A string is finite sequence of characters over a non-empty finite set Σ. In this problem, Σ is the set of lowercase letters. Substring, also called factor, is a consecutive sequence of characters occurrences at least once in a string. Now your task is a bit harder, for some given strings, find the l
? 解题记录 ? ? SPOJ ? ? 后缀自动机 ? ? 补档计划第一期 ?    2017-08-31 20:19:13    516    0    0
LCS - Longest Common Substringno tags  A string is finite sequence of characters over a non-empty finite set Σ. In this problem, Σ is the set of lowercase letters. Substring, also called factor, is a consecutive sequence of characters occurrences at least once in a string. Now your task is si