Problems Description
<p class="p0"> <span style="font-size:10.5pt;font-family:'Times New Roman';"> </span><span style="font-size:10.5pt;font-family:'宋体';">若给定序列<span>X={x1,x2,</span><span>…</span><span>,xm}</span><span>,则另一序列</span><span>Z={z1,z2,</span><span>…</span><span>,zk}</span><span>,是</span><span>X</span><span>的子序列是指存在一items严格递增下标序列</span><span>{i1,i2,</span><span>…</span><span>,ik}</span><span>使得对于所有</span><span>j=1,2,</span><span>…</span><span>,k</span><span>有:</span><span>zj=xij</span><span>。例如,序列</span><span>Z={B</span><span>,</span><span>C</span><span>,</span><span>D</span><span>,</span><span>B}</span><span>是序列</span><span>X={A</span><span>,</span><span>B</span><span>,</span><span>C</span><span>,</span><span>B</span><span>,</span><span>D</span><span>,</span><span>A</span><span>,</span><span>B}</span><span>的子序列,相应的递增下标序列为</span><span>{2</span><span>,</span><span>3</span><span>,</span><span>5</span><span>,</span><span>7}</span><span>。</span></span><span style="font-size:10.5pt;font-family:'Times New Roman';"></span> </p> <p class="p0"> <span style="font-size:10.5pt;font-family:'宋体';">给定<span>2</span><span>items序列</span><span>X</span><span>和</span><span>Y</span><span>,当另一序列</span><span>Z</span><span>既是</span><span>X</span><span>的子序列又是</span><span>Y</span><span>的子序列时,称</span><span>Z</span><span>是序列</span><span>X</span><span>和</span><span>Y</span><span>的公Total子序列。</span></span><span style="font-size:10.5pt;font-family:'Times New Roman';"></span> </p> <p class="p0"> <span style="font-size:10.5pt;font-family:'宋体';">给定<span>2</span><span>items序列</span><span>X={x1,x2,</span><span>…</span><span>,xm}</span><span>和</span><span>Y={y1,y2,</span><span>…</span><span>,yn}</span><span>,找出</span><span>X</span><span>和</span><span>Y</span><span>的最长公Total子序列。</span></span> </p>
Input格式
<p> 为保障统计正确,需在输入字符数组x和y的Page 一items字符设置标示,该字符不参与统计 </p> <p> Page 一行输入序列x。 </p> <p> Page 二行输入序列y。 </p>
Output格式
<p> Page 一行输出最大子串长度。 </p> <p> Page 二行输出最大子串。 </p>
Sample
Sample Input 1
@thiscbook
#tisnook
Sample Output 1
6
tisook
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪