Titlebook: ;

后天習(xí)得

Efficiency,The efficiency of algorithms plays a central role in competitive programming. In this chapter, we learn tools that make it easier to design efficient algorithms.

Induction

中子

假裝是你

Dynamic Programming,Dynamic programming? is an algorithm design technique that can be used to find optimal solutions to problems and to count the number of solutions. This chapter is an introduction to dynamic programming, and the technique will be used many times later in the book when designing algorithms.

四海為家的人

Rheumatologist

解開(kāi)

Range Queries,In this chapter, we discuss data structures for efficiently processing range queries on arrays. Typical queries are range sum queries (calculating the sum of values) and range minimum queries (finding the minimum value).

凹室

Tree Algorithms,The special properties of trees allow us to create algorithms that are specialized for trees and work more efficiently than general graph algorithms. This chapter presents a selection of such algorithms.

OPINE

Mathematics,This chapter deals with mathematical topics that are recurrent in competitive programming. We will both discuss theoretical results and learn how to use them in practice in algorithms.

革新

Advanced Graph Algorithms,This chapter discusses a selection of advanced graph algorithms.