Задачи

Многу лесно · 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