Our solutions (Berkeley Blue) to the ACM ICPC Pacific Northwest 2016 contest.
Brief description of solutions
A: Longest Increasing Subsequence
B: Dijkstra's Algorithm/Dynamic Programming
C: Sliding Window, Greedy
D: -
E: -
F: 2SAT, Strongly Connected Components (Tarjan's Algorithm)
G: Maximum Bipartite Matching (Hopcroft Karp Algorithm)
H: Dynamic Programming
I: Ad Hoc, Simulation, Greedy
J: Simulation, Monotonic Sequence Trick (Queue), Binary Search
K: Math