Hal Burch在1999年春季假期的分析揭示了编程竞赛中仅存在16种核心问题类型，占IOI参赛题目的近80%。这些类型包括动态规划、贪心算法、完全搜索等，并详细阐述了掌握这16种类型问题的解题技巧，以及如何通过解决其中的40%问题来确保获得银牌，而解决80%则几乎能确保金牌。文章还提供大量的练习题帮助读者提升技能。
Hal Burch conducted an analysis over spring break of 1999 and made an amazing discovery: there are only 16 types of programming contest problems! Furthermore, the top several comprise almost 80% of the problems seen at the IOI. Here they are:
- Dynamic Programming
- Greedy
- Complete Search
- Flood Fill
- Shortest Path
- Recursive Search Techniques
- Minimum Spanning Tree
- Knapsack
- Computational Geometry
- Network Flow
- Eulerian Path
- Two-Dimensional Convex Hull
- BigNums
- Heuristic Search
- Approximate Search
- Ad Hoc Problems
The most challenging problems are Combination Problems which involve a loop (combinations, subsets, etc.) around one of the above algorithms - or even a loop of one algorithm with another inside it. These seem extraordinarily tricky to get right, even though conceptually they are ``obvious''.
If you can master solving just 40% of these problem types, you can almost guarantee a silver medal at the IOI. Mastering 80% moves you into the gold range almost for sure. Of course, `mastery' is a tough nut to crack! We'll be supplying a plethora of problems so that you can hone your skills in the quest for international fame.
扫一扫
1369
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
