公共子串

最新推荐文章于 2025-03-19 20:43:54 发布

原创最新推荐文章于 2025-03-19 20:43:54 发布 · 261 阅读

0 ·

CC 4.0 BY-SA版权

动态规划专栏收录该内容

21 篇文章

订阅专栏

公共子串

Time Limit:1000MS Memory Limit:65536K Total Submit:196 Accepted:111

Description

设有A、B两个字符串，找出A、B共同子串，每个字符串无相同字符，可以不连续，但顺序不能颠倒。

Input

第一行字符串A 第二行字符串Ｂ

Output

最长公共子串的长度.

Sample Input

abcfbc
abfcab

Sample Output

Source

elba

·              Var
·               s1,s2:string; 
·               i,j,best,p,q,r:longint; 
·               a:array[0..300,0..300] of longint; 
·              begin 
·               read(s1); readln; read(s2); 
·               for i:=1 to length(s1) do 
·                for j:=1 to length(s2) do begin 
·                                            if s1[i]=s2[j] then 
·                                                  begin 
·                                                    best:=0;
                                       p:=a[i-1,j-1]+1;                                                 q:=a[i,j-1]; 
r:=a[i-1,j]; 
if p>q then 
best:=p 
else best:=q; 
if r>best then 
best:=r; a[i,j]:=best;                
end else 
begin 
best:=0; p:=a[i,j-1]; q:=a[i-1,j]
if p>q then best:=p 
else best:=q; a[i,j]:=best;     end; end; Writeln(a[length(s1),length(s2)]); end.