Scribd
Upload
34 views

Libro-Competitive Programming Mujer

This document contains a table of contents that outlines 8 chapters on algorithms and data structures. Chapter 1 is an introduction. Chapter 2 discusses extensions to binary search, including parallel binary search and fractional cascading. Chapter 3 is about segment trees and related structures like wavelet trees. Chapter 4 covers tree decompositions such as centroid and heavy-light decompositions. Chapter 5 focuses on palindromes and algorithms like Manacher's algorithm and eertrees. Chapter 6 examines optimizations for dynamic programming problems. Chapter 7 is on polynomials and techniques like polynomial evaluation, interpolation, and the fast Fourier transform. Chapter 8 is about matroids and optimization problems on matroids such as matroid intersection.

Uploaded by

ALEX ATILIO PUENTE JARA
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
34 views

Libro-Competitive Programming Mujer

This document contains a table of contents that outlines 8 chapters on algorithms and data structures. Chapter 1 is an introduction. Chapter 2 discusses extensions to binary search, including parallel binary search and fractional cascading. Chapter 3 is about segment trees and related structures like wavelet trees. Chapter 4 covers tree decompositions such as centroid and heavy-light decompositions. Chapter 5 focuses on palindromes and algorithms like Manacher's algorithm and eertrees. Chapter 6 examines optimizations for dynamic programming problems. Chapter 7 is on polynomials and techniques like polynomial evaluation, interpolation, and the fast Fourier transform. Chapter 8 is about matroids and optimization problems on matroids such as matroid intersection.

Uploaded by

ALEX ATILIO PUENTE JARA
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Contents

1 Introduction 7

1.1 Competitions and platforms . . . . . . . . . . . . . . . . . . . . . . . 9

2 Extensions of binary search 19

2.1 Parallel binary search . . . . . . . . . . . . . . . . . . . . . . . . . . 20

2.2 Fractional cascading . . . . . . . . . . . . . . . . . . . . . . . . . . . 25

3 Segment trees rediscovered 31

3.1 Segment tree beats . . . . . . . . . . . . . . . . . . . . . . . . . . . 31

3.2 Historic information for sequences . . . . . . . . . . . . . . . . . . . 36

3.3 Wavelet trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39

4 Tree decompositions 49

4.1 Centroid decomposition . . . . . . . . . . . . . . . . . . . . . . . . . 49

4.2 Heavy-light decomposition . . . . . . . . . . . . . . . . . . . . . . . 54

5 Palindromes 61

5.1 Manacher’s algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . 61

5.2 Eertree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64

6 Dynamic programming optimizations 77

6.1 Sum over subsets (SOS) . . . . . . . . . . . . . . . . . . . . . . . . 77

6.2 Monotone queue optimization . . . . . . . . . . . . . . . . . . . . . 83

6.3 Convex hull optimization . . . . . . . . . . . . . . . . . . . . . . . . 89

6.3.1 Li Chao tree . . . . . . . . . . . . . . . . . . . . . . . . . . 94

5
6 CONTENTS

6.4 Knuth optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . 96

6.5 Divide and conquer optimization . . . . . . . . . . . . . . . . . . . . 102

6.6 Lagrange optimization . . . . . . . . . . . . . . . . . . . . . . . . . 109

6.7 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112

7 Polynomials 119

7.1 Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120

7.2 Interpolation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121

7.3 Fast Fourier transform . . . . . . . . . . . . . . . . . . . . . . . . . 125

7.4 Applications of the polynomial multiplication . . . . . . . . . . . . . . 132

7.5 Bitwise convolutions . . . . . . . . . . . . . . . . . . . . . . . . . . . 138

8 Matroids 145

8.1 Optimization problems on matroids . . . . . . . . . . . . . . . . . . 150

8.2 Matroid intersection . . . . . . . . . . . . . . . . . . . . . . . . . . . 153

Bibliography 161

You might also like