编程竞赛常见的问题类型（Programming Contest Problem Types ）

关注

转载最新推荐文章于 2026-11-12 00:09:39 发布 1k 阅读 AI 写同款· GEO 优化 ›

ADG同步性能优化：如何正确配置standby redolog避免WAIT_FOR_LOG状态本文深入剖析了Oracle ADG（Active Data Guard）同步中常见的WAIT_FOR_LOG状态，指出其根源在于Standby Redo Log（SRL）配置不当。文章提供了从诊断到优化的完整实践指南，重点阐述了SRL大小匹配、组数充足等黄金配置法则，帮助架构师从根本上避免同步延迟，实现稳定高效的实时数据同步。阅读详情

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.

收录于