Search found 2 matches
- Thu Jun 03, 2004 2:59 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10405 - Longest Common Subsequence
- Replies: 103
- Views: 44667
- Thu Jun 03, 2004 1:03 am
- Forum: Volume 104 (10400-10499)
- Topic: 10405 - Longest Common Subsequence
- Replies: 103
- Views: 44667
10405-why W.A
Ca any one help me.?? I don't know why I gotta W.A.........[cpp]
#include<stdio.h>
#include<string.h>
char s1[1009],s2[1009];
int m,n,i,j,M[1100][1100];
void Process()
{
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(s1[i-1]==s2[j-1])
M [j]=M[i-1][j-1]+1;
else if(M[i-1][j]>M [j-1])
M [j]=M[i-1][j ...
#include<stdio.h>
#include<string.h>
char s1[1009],s2[1009];
int m,n,i,j,M[1100][1100];
void Process()
{
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(s1[i-1]==s2[j-1])
M [j]=M[i-1][j-1]+1;
else if(M[i-1][j]>M [j-1])
M [j]=M[i-1][j ...