Pagini recente » Monitorul de evaluare | Atasamentele paginii Coding Contest Byte: The Square Root Trick | Diferente pentru blog/square-root-trick intre reviziile 5 si 6
Nu exista diferente intre titluri.
Diferente intre continut:
There is a standard dynamic programming solution:
== code(c) |
// best[i][j] = longest common sub sequence for A[0:i] and B[0:j], computed as below:
best[i][j] = longest common sub sequence for A[0:i] and B[0:j], computed as below:
if A[i] == B[j]:
best[i][j] = 1 + best[i - 1][j - 1]
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
