3 人解决，7 人已尝试。
6 份提交通过，共有 114 份提交。
9.0 EMB 奖励。
单点时限: 10.0 sec
内存限制: 256 MB
An anagram is a word or a phrase that is formed by rearranging the letters of another. For instance, by rearranging the letters of
William Shakespeare, we can have its anagrams
I am a weakish speller,
I'll make a wise phrase, and so on. Note that when A is an anagram of B, B is an anagram of A.
In the above examples, di erences in letter cases are ignored, and word spaces and punctuation symbols are freely inserted and/or removed. These rules are common but not applied here; only exact matching of the letters is considered.
For two strings $s_1$ and $s_2$ of letters, if a substring $s’_1$ of $s_1$ is an anagram of a substring $s’_2$ of $s_2$, we call $s’_1$ a hidden anagram of the two strings, $s_1$ and $s_2$. Of course, $s’_2$ is also a hidden anagram of them.
Your task is to write a program that, for given two strings, computes the length of the longest hidden anagrams of them.
Suppose, for instance, that
grandmother are given. Their substrings
gran are hidden anagrams since by moving letters you can have one from the other. They are the longest since any substrings of
grandmother of lengths ve or more must contain
anagram does not. In this case, therefore, the length of the longest hidden anagrams is four. Note that a substring must be a sequence of letters occurring consecutively in the original string and so
granm are not hidden anagrams.
The input consists of a single test case in two lines: $s_1,s_2$.
$s_1$ and $s_2$ are strings consisting of lowercase letters (a through z) and their lengths are between $1$ and $4000$, inclusive.
Output the length of the longest hidden anagrams of $s_1$ and $s_2$. If there are no hidden anagrams, print a zero.