|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||0||0||0||0.000%|
Racine Business Networks (RBN) has taken the Heuristic Algorithm Languages (HAL) company to court, claiming that HAL has taken source code from RBN UNIX™ and contributed it to the open-source operating system HALnix.
RBN and HAL both use a programming language with one statement per line, each of the form:
STOREA = STOREB + STOREC where
STOREC are variable names. In particular, the first variable name starts in the first column and is followed by a space, an equals sign, a space, a second variable name, a space, the addition symbol, a space, and a third variable name. The same variable name might appear more than one time on a single line. Variable names consist of 1…8 uppercase ASCII letters (‘A’…‘Z’).
RBN claims that HAL copied a consecutive sequence of lines directly from RBN's source code, making only minor modifications:
STOREA = STOREB + STORECmight have been changed to
STOREA = STOREC + STOREB.
Given source code for programs from RBN and HAL, find the longest consecutive sequence of lines from HAL's program that could have come from a consecutive sequence of lines from RBN's program using the modifications above. Note that the sequences of lines from the two programs do not have to start at the same line number in both files.
The output file should contain a single line with a single integer that is the length of the longest consecutive sequence of lines that HAL might have copied from RBN and transformed.
4 3 RA = RB + RC RC = D + RE RF = RF + RJ RE = RF + RF HD = HE + HF HM = HN + D HN = HA + HB
Lines 1-2 of RBN's program are the same as lines 2-3 of HAL's program, if the following variable name substitutions are performed on RBN's program: RA → HM, RB → D, RC → HN, D → HA, RE → HB. There is no matching with three or more lines.