Longest increasing subsequence: Difference between revisions

Content added Content deleted
m (→‎Patience sorting: no need for Int conversion (was used during debugging))
m (→‎Dynamic programming: implicit call to .elems)
Line 244: Line 244:
for 1 ..^ @d -> $i {
for 1 ..^ @d -> $i {
for ^$i -> $j {
for ^$i -> $j {
if @d[$j] < @d[$i] && @l[$i].elems < @l[$j].elems + 1 {
if @d[$j] < @d[$i] && @l[$i] < @l[$j] + 1 {
@l[$i] = [ @l[$j][] ]
@l[$i] = [ @l[$j][] ]
}
}