OJ Board

Sorry, I've looked at the old topics for this problem and read the code in those topics but I still don't understand why my code repeatedly gets me WA. I'm just using the standard LCS algorithm. Could someone please help me?

#include <stdio.h>
#include <string.h>

#define SIZE 110

#define MAX(a ...

Ah, thanks Jan!
I read the link and I got AC, I'll be more thorough with searching the forum next time.

Okay, I don't think I understand what the problem is really asking for then.

Sample Input:
10
3 1 2 4 9 5 10 6 8 7
1 2 3 4 5 6 7 8 9 10
4 7 2 3 10 6 9 1 5 8
3 1 2 4 9 5 10 6 8 7
2 10 1 3 8 4 9 5 7 6

I thought they wanted to know the length of the longest common subsequence between the first ...

Hi everyone,

I'm using the site http://icpcres.ecs.baylor.edu/onlinejudge/index.php, and when I browse the problem on their site I get:

Sample Output 2

6
5
10
9

But when I open the problem on pdf I get the following:

Sample Output 2

6
4
10
5

Which one is the correct output???