Classic
Clean & simple
Crystal
Glassmorphism + Neon
Cyberpunk
Neon glitch art
🚫
违规Action检测
禁止Use右键菜单
⚠️ 此Action已被系统记录
1

【二维一边推1.1】最长公Total子序列 LCS加强版

📝 Solutions 🔵 仅限 C++
Problems Description
<div style="text-transform: none; text-indent: 0px; margin: 0px 0px 10px; font: 14px/20px 'Helvetica Neue', Helvetica, Arial, sans-serif; white-space: normal; letter-spacing: normal; color: rgb(85,85,85); word-spacing: 0px; -webkit-text-stroke-width: 0px">给出两items字符串&nbsp;S1&nbsp;和&nbsp;S2&nbsp;求它们最长公Total子序列的长度。</div> <div style="text-transform: none; text-indent: 0px; margin: 0px 0px 10px; font: 14px/20px 'Helvetica Neue', Helvetica, Arial, sans-serif; white-space: normal; letter-spacing: normal; color: rgb(85,85,85); word-spacing: 0px; -webkit-text-stroke-width: 0px">什么是最长公Total子序列呢?</div> <div style="text-transform: none; text-indent: 0px; margin: 0px 0px 10px; font: 14px/20px 'Helvetica Neue', Helvetica, Arial, sans-serif; white-space: normal; letter-spacing: normal; color: rgb(85,85,85); word-spacing: 0px; -webkit-text-stroke-width: 0px"><span>&nbsp;&nbsp;&nbsp;&nbsp;</span>比如:</div> <div style="text-transform: none; text-indent: 0px; margin: 0px 0px 10px; font: 14px/20px 'Helvetica Neue', Helvetica, Arial, sans-serif; white-space: normal; letter-spacing: normal; color: rgb(85,85,85); word-spacing: 0px; -webkit-text-stroke-width: 0px"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;S1:='abbccdss'</span></div> <div style="text-transform: none; text-indent: 0px; margin: 0px 0px 10px; font: 14px/20px 'Helvetica Neue', Helvetica, Arial, sans-serif; white-space: normal; letter-spacing: normal; color: rgb(85,85,85); word-spacing: 0px; -webkit-text-stroke-width: 0px"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;S2:='aeebfcaadb'</span></div> <div style="text-transform: none; text-indent: 0px; margin: 0px 0px 10px; font: 14px/20px 'Helvetica Neue', Helvetica, Arial, sans-serif; white-space: normal; letter-spacing: normal; color: rgb(85,85,85); word-spacing: 0px; -webkit-text-stroke-width: 0px"><span>&nbsp;&nbsp;&nbsp;&nbsp;</span>那么S1和S2的最长公Total子序列就是:&quot;abcd&quot;.&nbsp;这items说明最长公Total子序列强调位置的前后关系不变,但不在乎是否连续。另外&nbsp;最长公Total子序列不唯一。任意输出一items最长的公Total子序列即可。</div> <div style="text-transform: none; text-indent: 0px; margin: 0px 0px 10px; font: 14px/20px 'Helvetica Neue', Helvetica, Arial, sans-serif; white-space: normal; letter-spacing: normal; color: rgb(85,85,85); word-spacing: 0px; -webkit-text-stroke-width: 0px">【输入格式】<br /> 读入两行,points别是S1和S2( 长度不大于1000)。<br /> 【输出格式】<br /> 输出一items整数。即为最长公Total子序列的长度。</div> <div style="text-transform: none; text-indent: 0px; margin: 0px 0px 10px; font: 14px/20px 'Helvetica Neue', Helvetica, Arial, sans-serif; white-space: normal; letter-spacing: normal; color: rgb(85,85,85); word-spacing: 0px; -webkit-text-stroke-width: 0px"> <p>&nbsp;【输入样例】</p> <p>abbccdss<br /> aeebfcaadb</p> <p>【输出样例】<br /> 4<br /> abcd<br /> </p> </div> <p></p>
Input格式
Output格式
Submit Code
请先Login后Submit

🤖 AI 解题助手

OpenRouter
就绪
👋 你好!我是 AI 解题助手。
我已阅读了这problems题,可以帮你points析思路、提供Code示例。
🔓 完全Free · 无需消耗 Token