Problems on the theme "Maximum non-decreasing subsequence"

Abstract

In the article, using the example of solving few problems, the methodology for studying the theme "Maximum non-decreasing subsequence" is illustrated in preparing schoolchildren for Olympiads in informatics. The study is based on the sequential solution of increasingly complex problems. For each problem, the following materials are given: the formulation of the problem, the idea of a solution, the solution in the Pascal programming language. Distance learning system (http://dl.gsu.by) is the technical base for teaching. The system allows to offer for a student a formulation of the problem; to submit the solution for review; to get a verdict from the system — a correct or incorrect solution; for incorrect solution, the number of the test on which the solution did not pass is indicated. A student can take a test (input and output data), on which his solution did not pass, figure out what the error is in his program, correct it and send the solution again. In addition, for each problem there is a link on it to the topic in the forum at site, where you can ask a question on solving this problem and / or read the answer if the questions have already been asked before.