信息学国家集训队作业100book

1、A Guide to Tough Problem SelectionRujia LiuIntroductionIntroduction to IOI2003 Training TeamIntroduction to our Training ProgramsContent & OrganizationCreditPart I - Graph TheoryTheorySpanning Trees: 4(0021), 10(0063)Structure: 6(0047), 8(0083)Other: 2(0006), 9(0062)ModelingShortest Paths: 1(0005)Ma

2、tch: 3(0017)Other: 5(0075), 7(0020)Planar Graph: 28(0077)Part I - GeometryGrid: 11(0002)Polygon: 12(0035)Circle: 13(0033)3D-Geometry: 14(0012)A Nice Problem: 15(0084)Part I - MathNumber Theory17(0019)21(0055)22(0073)Observation & Proof16(0037)19(0040)Game: 18(0036)Part I - AlgorithmicDynamic Program

3、ming: 27(0044), 29(0070)String: 24(0038)Greedy: 20(0041), 25(0053)Data Structure: 23(0023), 26(0043)AI: 30(0099)Part II - IntroductionMessenger - 1(0010)Airline - 2(0050)Unary Cow Counting - 3(0009)Super Horse - 5(0052)Time Zones - 6(0097)Part III - IntroductionMeeting - 4(0061)Visit - 5(0022)Warshi

4、ps - 15(0086)Recursive Ants - 13(0098)Push - 16(0088)Part IV - IntroductionClean - 2(0004)Gataxx! - 4(0053)SuperTurn - 5(0072)Adventure - 6(0079)Sweep - 7(0100)Part V - IntroductionDiving - 1(0051)Burmuda - 4(0059)Park - 5(0085)Acid - 6(0095)Square - 7(0087)Irrigation - 8(0060)Thank you!We are always trying to improve ourselvesAny Comments & Corrections are E!Look forward to your suggestion