Задачи

Много трудно · 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