All about Longest Increasing Sub-sequence (LIS) October 10, 2017 Dynamic Programming - (N*N) calculating LCS value print solution LCS (NlogN) Share Get link Facebook X Pinterest Email Other Apps Labels dp lis lis_nlogn study Share Get link Facebook X Pinterest Email Other Apps Comments
strongly connected components December 21, 2017 strongly connected components in directed graph. Kosaraju's algorithm. Read more
Histogram - LOJ November 16, 2021 It's a well-known problem and the well-known solution is using a stack. I tried to solve it by segment tree( iterative version for building tree ) and got TLE. Hope I can optimize the code. TLE CODE Read more
Comments
Post a Comment