Zadania

Maximum Sum#2911

Łatwe · Segment Tree · Prefix Sums · Queries

Glass Beads#2912

Bardzo łatwe · Strings

XOR pairs#2915

Łatwe · Binary Search

Translating pebbles#2918

Łatwe · Greedy algorithms

Is this the left heap?#2919

Łatwe · Binary Search · Data Structures

Height of the left tree#2920

Średnie · Data Structures · Math · Binary Search

The Right Path of the Left Tree#2921

Bardzo łatwe · Binary Search

Union of rectangles 2#2922

Bardzo łatwe · Sorting · Geometry

Tree#2923

Bardzo łatwe · Trees

Tree in a Segment#2924

Łatwe · Depth-first Search · Trees · Queries

Strings in the Tree#2925

Trudne · Graphs · String suffix structures

Combined rectangles#2926

Bardzo łatwe · Geometry · Sorting

Union of Sets#2927

Bardzo łatwe · Sorting

Non-prefix codes#2928

Łatwe · Greedy algorithms

Rain#2929

Łatwe · Geometry · Dynamic programming

Dima and the Famous Tourist#2931

Łatwe · Graphs · Shortest paths

Dima and lines#2932

Bardzo łatwe · Implementation · String suffix structures · Data Structures

Dima and the Computer Game#2933

Bardzo łatwe · Geometry

Dima and Percentages#2935

Łatwe · Probabilities · Strings

Dima & module#2936

Trudne · Number theory · Bitwise Operations · Math

Maksym and the Time Machine#2937

Łatwe · Segment Tree · Implementation

Dima and the Time Machine#2938

Bardzo łatwe · Segment Tree · Prefix Sums

Dima and array 1#2939

Łatwe · Segment Tree · Implementation

2776-2800 z 9226