Z-algorithm:
- https://codeforces.com/contest/432/problem/D
- https://codeforces.com/contest/1537/problem/E2
- https://codeforces.com/contest/126/problem/B
- https://codeforces.com/contest/149/problem/E
Binary Search:
- https://codeforces.com/contest/432/problem/C
- https://codeforces.com/contest/1530/problem/C
- https://codeforces.com/contest/1619/problem/D
- https://codeforces.com/contest/1624/problem/F
- https://codeforces.com/contest/1661/problem/C
- https://codeforces.com/contest/1712/problem/D
- bs+range query
- simulate and find pattern
- So much tight TL
DFS:
- https://codeforces.com/contest/1209/problem/D
- https://codeforces.com/contest/1167/problem/C
- https://codeforces.com/contest/1537/problem/F
- https://codeforces.com/contest/505/problem/B
- https://codeforces.com/problemset/problem/24/A
- smart work with dfs tree
BFS:
DSU:
- https://codeforces.com/contest/1167/problem/C
- https://codeforces.com/contest/982/problem/D
- https://codeforces.com/contest/1609/problem/D
- https://codeforces.com/contest/1620/problem/E
- https://toph.co/p/hashing
- https://codeforces.com/problemset/problem/1691/E
- Odd sized groups
- group size is important
- Convert it to a RmxQ problem
- Weighted DSU
- DP with DSU
Dynamic Programming:
- https://codeforces.com/problemset/problem/189/A
- https://codeforces.com/contest/1132/problem/F
- https://codeforces.com/contest/895/problem/C
- https://codeforces.com/problemset/problem/118/D
- https://lightoj.com/problem/a-refining-company
- https://codeforces.com/problemset/problem/431/C
- https://codeforces.com/problemset/problem/474/D
- https://codeforces.com/problemset/problem/711/C
- https://lightoj.com/problem/bar-codes
- https://codeforces.com/contest/505/problem/C
- https://codeforces.com/problemset/problem/1508/B
- https://codeforces.com/contest/204/problem/A
- https://atcoder.jp/contests/abc222/tasks/abc222_d
- https://codeforces.com/contest/1593/problem/F
- https://codeforces.com/contest/1581/problem/C
- https://codeforces.com/contest/1582/problem/F2
- https://codeforces.com/contest/1579/problem/F
- https://codeforces.com/problemset/problem/1575/D
- https://codeforces.com/contest/1609/problem/C
- https://codeforces.com/contest/1614/problem/D1
- https://codeforces.com/contest/1613/problem/D
- https://codeforces.com/contest/1207/problem/C
- https://algo.codemarshal.org/contests/icpc-dhaka-20-preli/problems/G
- https://codeforces.com/contest/1624/problem/E
- https://codeforces.com/contest/1635/problem/D
- CF- D. XOR-pyramid
- WITH MONOTONUS QUEUE
- https://toph.co/p/switchblade-of-thanos
- https://codeforces.com/contest/1680/problem/E
- SOS dp
- https://www.codechef.com/problems/SONGSHOP
- dp+bs+cycle detection
- dp+totient
- dp+binary tree
- dp+prefix sum
- dp+greedy+bitmasking
- https://codeforces.com/contest/1699/problem/D
- DP+map
- Only iterative and memory optimization
- DP+hashing
- super ovservation
- prefix sum+bs+number theory
- Optimization with unique value and Binary.
- seem bipartite coloring but not
- divide and conquer
- Simple but cool
- gcd
- make strictly increasing or decreasing
- dp in dense graph
- Optimal Cycle Finding
- Optimazation using segtree
- sqrt memorize in a tree
- think reverse
- Next is at most current max minus one
- monotic queue eliminates log(n)
- Exchange arg+ Optimization using constraints
- Every bit separately
- Great optimization using bitset
- Number of LIS
- Exchange Argument is cool
- Game turns into equal subsequence DP
- Heavy Precision Handling
- Nice Knapsack
- Nice work with ancestor. time limit 7s!
- Nice one to learn dp with ds
- work with the edge array
- Arithmatic Progression
- Hard and Educational
- DP with DSU
- DP with Prefix Sum
- Convex Hull Trick
Centroid of tree:
Combinatorics:
Minimum Spanning Tree:
Segment Tree:
- https://codeforces.com/problemset/problem/1547/F
- https://toph.co/p/a-unique-array
- https://codeforces.com/contest/1661/problem/D
- https://toph.co/p/maximum-distance
- Good use of lazy in bracket seq.
- Artihmatic Progression
- Really Educational
- Really Educational (Curcular Range and minmum with cnt)
- Maintain INcreasing Array
Sparse Table:
Scanline Algorithm:
Hashing:
BINARY INDEXED TREE:
TOPOLOGICAL SORT:
BIPARTITE GRAPH:
MONOTONIC QUEUE:
Expected Value:
Prime Factorization:
Number Theory:
Mo's Algorithm:
Sqrt Decomposition:
Suffix Array:
Dense Graph:
Floyd Warshall:
Meet in the Middle:
Palindromic Tree:
DSU on Tree:
Compiler Optimization:
Compiler Optimization:
Strongly Connected Components:
Matrix Multiplication:
Binary Lifting:
Bitmask:
Bellman-Ford:
Pigeonhole Principle:
Geometry:
Geometry:
Difference Array:
XOR Basis:
Educational Problems:
Min cost max flow:
Articulation Bridge:
Posts
0 Comments