Задачи

Много лесно · Sorting · Greedy algorithms

Много лесно · Brute force · String suffix structures

Много лесно · Graphs

Лесно · Implementation

Средно · Greedy algorithms · Sorting · Geometry

Трудно · Dynamic programming · Combinatorics · Number theory

Лесно · Graphs · Shortest paths

Много лесно · Dynamic programming · Prefix Sums

Трудно · Trees · Depth-first Search · Combinatorics · Prefix Sums · Binary Search

Много трудно · Dynamic programming · Combinatorics · Greedy algorithms · Number theory · Stacks

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

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

Средно · Greedy algorithms · Prefix Sums

Средно · Sorting · Greedy algorithms

Много лесно · Prefix Sums · Implementation

Лесно · Graphs · Disjoint set union

Много лесно · Binary Search · Data Structures · Dynamic programming

Много трудно · Binary Search · Data Structures · Greedy algorithms · Sorting

Много трудно · Prefix Sums · Dynamic programming · Greedy algorithms · Scanline / Sweep Line

Лесно · Prefix Sums · Dynamic programming

Много трудно · Trees · Dynamic programming · Combinatorics · Depth-first Search · Number theory

Много трудно · Dynamic programming · Dynamic Programming Optimization · Fenwick Tree · Segment Tree · Divide and Conquer

Много лесно · Geometry

Много лесно · Brute force

Много лесно · Sorting · Greedy algorithms