// the find
Trinkle23897/oi_slides
我的 OI 课件
A personal archive of competitive-programming lecture slides, mostly in Chinese, covering IDA*, DLX, DP and its optimisations, segment trees, K-D trees, computational geometry and search. The material comes from 2016 to 2017 training camps and is aimed at Chinese-speaking OI competitors who want a specific algorithm lecture. It has not changed since August 2020.
- The decks were written for real contest preparation: THU training camps, THUSC 2017, NOIP summer camps and Fujian provincial team training. The topic choices reflect what competitors needed before a contest, not what makes a neat textbook chapter.
- Each deck covers one focused topic, such as DLX, K-D trees or computational geometry, rather than a survey. That makes it easy to find the lecture you need.
- The decks share the THU Beamer theme, so they look consistent. The 38-page algo.pdf template collection works as a quick reference sheet.
- Only compiled PDFs are visible in the repo, with no LaTeX sources and no build instructions. A correction or update means working from original sources that are not here.
- Nearly everything is in Chinese, and the only index is a README table organised by date and camp rather than by topic. Finding the DP lecture means scanning filenames.
- Slides without accompanying prose or code only work with a speaker present. For self-study the content is thin unless you already know the topic, and the last push was in August 2020, so none of the material has been revisited.