คอมพิวเตอร์โอลิมปิก¶
Warning
เอกสารชุดนี้อยู่ในระหว่างการปรับปรุง
วันที่ (Date) |
ช่วงเช้า (08.30-12.00) |
ช่วงบ่าย (13.00-15.00) |
Practice (15.00-17.00) |
|---|---|---|---|
Day 01 |
C++ Review Data types, Variables & Functions |
Foundations Arrays, Control structures & Fast I/O |
Practice Fast I/O & C++ Syntax |
Day 02 |
Complexity Analysis Big O & Efficiency estimation |
Binary Search Implementation on arrays & on answer |
Practice Binary Search Problems |
Day 03 |
STL I vector, stack, queue & priority_queue |
STL II set, map & unordered_map (hashing) |
Practice STL Application problems |
Day 04 |
Recursion Concepts & Recursive mathematical functions |
Complete Search Backtracking & Pruning techniques |
Practice Backtracking (N-Queens, Subsets, Permutations) |
Day 05 |
DP Basics Memoization vs Iterative (Smart Recursion) |
DP Standard Knapsack, Coin Change & LIS |
Practice DP problems on CSES or AtCoder Educational DP |
Day 06 |
Trees Definition, Representation & Traversal |
Tree Traversal BFS & DFS applications |
Practice Tree problems (Diameter, Ancestors, Distances) |
Day 07 |
Graphs Adjacency list/matrix & DSU (Union-Find) |
Graph Algorithms MST (Kruskal/Prim) & Topological Sort |
Practice Graph construction & DSU problems |
Day 08 |
Shortest Paths I Dijkstra's algorithm |
Shortest Paths II Bellman-Ford & Floyd-Warshall |
Practice Pathfinding problems (CSES Graph section) |
Day 09 |
Advanced DS Segment Tree & Fenwick Tree (Range Queries) |
Greedy & D&C Optimization techniques |
Practice Range Query problems |
Day 10 |
Basic Problems for Competitive Programming I & II |
Contest Strategy Time management & Subtask scoring |
Practice Mixed Problem Set (Easy to Medium) |
Day 11 |
Intermediate Problems for Competitive Programming I & II |
Mock Contest I IOI/ICPC Style interaction |
Practice Up-solving problems from Mock Contest I |
Day 12 |
Advance Problems for Competitive Programming I & II |
Mock Contest II Advanced topics & Subtasks |
Practice Up-solving & Final Review Session |