The Applied Research Of PAR Method On The Problems Of The Informatics Olympiad Race

With the National Olympiad in Informatics more and more difficult, the students, who want to do well in it, must have a good knowledge of all subjects and excellent overall qualities and comprehensive ability. To do such exercises, students must see the nature of the phenomena, grasp the principal contradiction and keep to the point. Namely, make the problem abstract, formalizated and modelized with the knowledge they learnt and compile the program to solve the problem.Prof. Xue Jinyun put forward and developed the PAR method by supported by several national and provincial research projects. With learning and mastering the new algorithm design method, students can ease their fear of program design. Program, which is a subject of science and a kind of art, just like the beauty of poems and composing, will be the enjoyment of the designer not a burden.The following are the main research work in this thesis:To begin with, studying the variety of the questions in the National Olympiad in Informatics in recent years; making a simple introduction to the PAR method, studying its characteristics and illustrating the procedures of developing PAR method.Then,I selected four typical model topics in then National Olympiad in Informatics(the Problem of GODI's tourist,the Problem of highway programming,the Problem of intercepting missile,the Problem of branching tree), and provided common algorithmics and analysed them in detail. At last, created algorithms to solve the four typical questions with the PAR method.In this thesis, we solved many algorithms (eg. Exhaustive method, greedyselector method, the divide and conquer method, the dynamic programming and backtracking etc.) with the PAR method, which certified the use of the PAR method in many complicated algorithms. Therefore, we can solved many problems in the the National Olympiad in Informatics with the PAR method, because of the length of the thesis, we havn't calculated more.