XiXi's Competitive Programming L2: CSP-J Basic Algorithms & Data Structures

Enumerate all possible solutions and filter for answers

Master defining, accessing, and traversing one-dimensional arrays

Understand recurrence relations and the basics of dynamic programming

Use prefix sums to optimize range queries

Learn character array operations and problem simulation techniques

Master commonly used methods of the C++ string class

Develop modular programming thinking with function encapsulation

Understand pass-by-value, pass-by-reference, and parameter types

Master recursive thinking and recursive function design

Learn binary, octal, and hexadecimal conversions

Understand character encoding and data storage principles

Master the implementation and applications of selection sort

Learn greedy strategies and the idea of local optimal solutions

Understand the principles and optimization of bubble sort

Master the advantages of insertion sort on partially sorted data

Learn linear-time counting sort

Master the sort function and custom comparators

Learn struct definitions and union memory management

Master declaring and accessing multi-dimensional arrays

Use 2D prefix sums to optimize rectangular region queries

Understand pointer concepts, address arithmetic, and dereferencing

Master pointer arrays, function pointers, and dynamic memory

Learn file input/output and exception handling mechanisms