第一篇正式的课文：竞赛题目的类型

       今天早上八点台风刚好登录。。。作为苦逼的湖建人民果断停课了。。。在家里蹲了一天，晚上看看雨没多大，于是决定溜到学校电脑室，继续刷USACO以示沉痛哀悼。

Programming Contest Problem Types

Hal Burch conducted an analysis over spring break of 1999 and made anamazing discovery: there are only 16 types of programming contest problems!Furthermore, the top several comprise almost 80% of the problems seen at theIOI. 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 aloop (combinations, subsets, etc.) around one of the above algorithms - or evena loop of one algorithm with another inside it. These seem extraordinarilytricky to get right, even though conceptually they are ``obvious''.

If you can master solving just 40% of these problem types, you can almostguarantee a silver medal at the IOI. Mastering 80% moves you into the goldrange almost for sure. Of course, `mastery' is a tough nut to crack! We'll besupplying a plethora of problems so that you can hone your skills in the questfor international fame.

讲的大致内容是不知道哪个砖家做了一项调查，说在IOI历史上只考过16种算法【尼玛（丿°皿°）丿丄丄】好像挺重要的，在这里翻译粗来：

1.        动态规划

2.        贪心

3.        枚举搜索

4.        灌水法

5.        最短路

6.        回溯搜索

7.        最小生成树

8.        背包问题（为什么不放到1去= =）

9.        计算几何

10.    网络流

11.    欧拉路

12.    二维凸包（= =尼玛不也是9的内容）

13.    高精度（不知道翻译得准不准。。。看好多人都写大数问题，但不知道是什么，欢迎大神指教）

14.    启发式搜索

15.    近似搜索（这个又是什么鬼= =）

16.    杂类问题

    据说这些东西只要会40％就保证银牌，会80％就有可能金牌了（丿°皿°）丿丄丄，不管怎样，反正也就剩两个月，j结果。。。天知道