- AMR11A.cpp : Dynamic Programming - bottom up approach
- arraysub.cpp : Segment Trees
- amr11f_dijkstra.cpp : Dijkstra + Adjecency List + Priority Queue (TLE)
- amr11f_floyd_warshall.cpp : Floyd Warshall (WA)
- brckts.cpp : Segment Trees
- bridge.cpp : Longest Increasing Subsequence
- candle.cpp : Naive Approach
- coins.cpp : Dynamic Programming - Memorization
- frequent.cpp : Segment Trees
- gss1.cpp : Segment Trees
- gss3.cpp : Segment Trees
- gss5.cpp : Segment Trees
- kgss.cpp : Segment Trees
- shpath.cpp : Dijkstra + Min Heap + Adjecency List
- sumtrian.cpp : Dynamic Programming - bottom up approach
- blinnet.cpp : Minimum Spanning Tree
- iitk1P10.cpp : Breadth First Search
- DCEPC701.cpp : Dikjstra
- SEATSR.cpp : Levenshtein distance (edit distance) with further optimization according to the problem
- HORRIBLE.cpp : Segment Tress with Lazy Propagation
- LITE.cpp : Segment Tress with Lazy Propagation
- DQUERY.cpp : Offline Algorithm in Segment Trees
- the-quickest-way-up.cpp : Dijkstra
- FNCS.cpp : Segment Tree + Square root decomposition
- XMAX.cpp : Guassian forward elimination
- red-john-is-back.cpp : Dynamic Programming + Probability
omerjerk / code Goto Github PK
View Code? Open in Web Editor NEWSolutions of SPOJ/CodeChef/HackerRank