Homework before week 7¶

This week we will continue with graph algorithms. In our homework we will cover the following topics:

lowest common ancestor
maximum flow.

Homework reading¶

We will follow Competitive Programmer’s Handbook by Antti Laaksonen. Please read (at least) the following part to prepare for week 7:

Section 18.1: Finding ancestors
Section 20.1: Ford–Fulkerson algorithm

Homework problems¶

You will find here a mini-contest with two tasks: cses.fi/525/list/. Please ask in Zulip if you need help!

To complete the homework, solve these tasks before the contest closes. Please use your own personal CSES account. Once you have completed the homework contest, please submit the following form:

A+ presents the exercise submission form here.