Anonymous user
Longest increasing subsequence: Difference between revisions
Simpler D entry
(Less flexible D entry) |
(Simpler D entry) |
||
Line 24:
static struct Node { T val; Node* back; }
auto pile = [[new Node(items[0]
OUTER: foreach (immutable di; items[1 .. $]) {
| |||