Open maxhwardg opened 8 years ago
Longest increasing sub-sequence in O(n log n). Matrix chain multiplication. Egg dropping. Convex hull trick, divide and conquer trick, Knuth optimization. (see http://codeforces.com/blog/entry/8219).
Longest increasing sub-sequence in O(n log n). Matrix chain multiplication. Egg dropping. Convex hull trick, divide and conquer trick, Knuth optimization. (see http://codeforces.com/blog/entry/8219).