Titlebook: ;

BLUSH

Data Structures,This chapter introduces the most important data structures of the C. standard library. In competitive programming, it is crucial to know which data structures are available in the standard library and how to use them. This often saves a large amount of time when implementing an algorithm.

熱情的我

Indict

Graph Algorithms,Many programming problems can be solved by considering the situation as a graph and using an appropriate graph algorithm. In this chapter, we will learn the basics of graphs and a selection of important graph algorithms.

MORT

Algorithm Design Topics,This chapter discusses a selection of algorithm design topics. Section?. focuses on bit-parallel algorithms that use bit operations to efficiently process data. Typically, we can replace a for loop with bit operations, which may remarkably improve the running time of the algorithm.

樹木中

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.

使饑餓

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.

molest

樹上結(jié)蜜糖

未開化