# SP1812 LCS2 - Longest Common Substring II

• 201通过
• 652提交
• 题目来源
• 评测方式 RemoteJudge
• 标签 后缀数组,SA 后缀自动机,SAM 字符串 概率论,统计
• 难度 省选/NOI-
• 时空限制 236ms / 1536MB
• 提示：收藏到任务计划后，可在首页查看。

## 题意翻译

题面描述 给定一些字符串，求出它们的最长公共子串 输入格式 输入至多$10$ 行，每行包含不超过$100000$ 个的小写字母，表示一个字符串 输出格式 一个数，最长公共子串的长度 若不存在最长公共子串，请输出$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 length of the longest common substring of them.

Here common substring means a substring of two or more strings.

## 输入输出格式

输入格式：

The input contains at most 10 lines, each line consists of no more than 100000 lowercase letters, representing a string.

输出格式：

The length of the longest common substring. If such string doesn't exist, print "0" instead.

## 输入输出样例

输入样例#1： 复制
alsdfkjfjkdsal
fdjskalajfkdsla
aaaajfaaaa
输出样例#1： 复制
2
提示
标程仅供做题后或实在无思路时参考。
请自觉、自律地使用该功能并请对自己的学习负责。
如果发现恶意抄袭标程，将按照I类违反进行处理。