Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
Look up keyword or section
Like this

Table Of Contents

1 Dynamic Programming
1.1 Subset Sum
1.2 The Longest Increasing Subsequence
1.3 Longest Common Subsequence
1.3.1 Reduce the Space to One Dimension
1.4 Max Sum on a Line
1.5 The Best Triangulation
1.6 Counting or Optimizing Good Paths
2 Graphs
2.1 Breadth First Search
2.2 Depth First Search
2.2.1 Topological Sorting
2.2.2 Strongly Connected Components
2.2.3 Cut Point
2.3 Shortest Paths
2.3.1 Bellman-Ford
2.3.2 Floyd-Warshall
2.3.3 Dijkstra
2.3.4 The Shortest Path DAG
2.4 Counting the Paths
2.5 The Minimum Average Cycle
2.6 The Minimum Spanning Tree
2.7 Bipartite Matching
2.8 Maximum Flows
2.9 Minimum (Maximum) Cost Bipartite Matching
2.10 Minimum Cost (Maximum Profit) Flow
3 Numbers
3.1 the Greatest Common Divisor
3.2 Generating the Prime Table
3.3 Repeated Squaring
3.4 Long Integers using Character Arrays
3.5 Fractional Numbers
4 Algebra
4.1 the Matrix Library
4.2 the Method of Relaxation
5 Geometry
5.1 the Geometry Library
5.2 Some Geometric Facts
6 Miscellaneous
6.1 Binary Search
6.2 Range Query
6.3 Set Union and Find
6.4 String Matching
6.5 2D Arrays, Rectangles
6.5.1 Cover the Chessboard with Rectangles
6.5.2 2D Max Sum
6.5.3 Max Unaffected Rectangle
7.1 Combinatorics
7.2 Dynamic Programming
7.3 Graphs
7.3.1 BFS
7.3.2 DFS
7.3.3 Max Flow
7.3.4 Min Cost Flow and Matching
7.4 Long Integers
0 of .
Results for:
No results containing your search query
P. 1


Ratings: (0)|Views: 4|Likes:
Published by Pratik Mehta

More info:

Categories:Types, Calendars
Published by: Pratik Mehta on Sep 02, 2012
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





You're Reading a Free Preview
Pages 4 to 72 are not shown in this preview.
You're Reading a Free Preview
Pages 76 to 78 are not shown in this preview.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->