| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:路过的帮忙看看啊!我用最大长度减去最长公共子序列的长度ac的,但不明白这为什么会错In Reply To:路过的帮忙看看啊!我用最大长度减去最长公共子序列的长度ac的,但不明白这为什么会错 Posted by:20071002871 at 2008-11-25 12:21:26 > #include<stdio.h>
> #include<string.h>
> int main()
> {
> int i,j,m,n;char a[1002],b[1002],f[1002][1002];
> while(EOF!=scanf("%d%s%d%s",&m,a+1,&n,b+1))
> {
> if(strcmp(a+1,b+1)==0)
> {
> printf("0\n");
> continue;
> }
> for(i=0;i<=m;i++)
> f[i][0]=i;
> for(i=0;i<=n;i++)
> f[0][i]=i;
> for(i=1;i<=m;i++)
> for(j=1;j<=n;j++)
> {
> f[i][j]=f[i-1][j-1]+1;
> if(a[i]==b[j])
> f[i][j]=f[i][j]-1;
> if(f[i-1][j]+1<f[i][j])
> f[i][j]=f[i-1][j]+1;
> if(f[i][j-1]+1<f[i][j])
> f[i][j]=f[i][j-1]+1;
> }
> printf("%d\n",f[m][n]);
> }
> return 0;
> }
>
>
printf("%d\n",f[m][n]);
->
printf("%d\n",n-f[m][n]);
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator