● [参赛经验]3 - 荔园在线 | 深圳大学学生论坛,荔园晨风BBS,深大在线网站

荔园之美，在春之萌芽，在夏之绽放，在秋之收获，在冬之沉淀

发信人: kaman (天外飞仙), 信区: ACMICPC
标  题: [参赛经验]3
发信站: 荔园晨风BBS站 (Tue Mar 23 10:44:50 2004), 站内信件

内容提要：

该文章将IOI竞赛中的试题分为了16类，研究这些类别的典型算法对参赛会有很大帮助
。

              Programming Contest Problem Types

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.

--
Long long ago,there is a hero stand at the edge of the land.......

     ▁▁
   ▕天外▏
   ▕飞仙▏
     ▔▔

※ 来源:·荔园晨风BBS站 bbs.szu.edu.cn·[FROM: 192.168.111.157]

荔园在线首页友情链接：深圳大学深大招生荔园晨风BBS S-Term软件网络书店