Задачи

Многу тешко · Disjoint set union · Dynamic programming · Graphs

Многу тешко · Dynamic programming · Matrix · Prefix Sums · Combinatorics · Queries

Многу тешко · Convex Hull · Binary Search · Sorting · Geometry

Многу лесно · Implementation

Многу лесно · Sorting · Queries

Средно · Constructive Algorithms

Средно · Implementation · Prefix Sums

Тешко · Binary Search · Implementation

Средно · Segment Tree · Dynamic programming · Prefix Sums

Многу тешко · Graphs · Prefix Sums · Trees · Data Structures

Средно · Interactive · Binary Search

Средно · Binary Search · Graphs

Лесно · Binary Search · Dynamic programming

Многу лесно · Implementation

Лесно · Greedy algorithms

Средно · Greedy algorithms · String suffix structures

Многу лесно · Implementation · Data Structures

Лесно · Graphs · Dijkstra algorithm · Shortest paths

Многу тешко · Graphs · Brute force

Многу лесно · Math

Средно · Greedy algorithms · Strings

Многу лесно · Implementation

Лесно · Data Structures

Лесно · Implementation

Лесно · Binary Search · Math