YoungForest's blog

Four solutions compare binary runs, binary-search speed, update jump ranges once, and use linear DP for the best stone-game score difference.

Three solutions sort sentence pieces, simulate growing memory allocations and rotate a box; the floor-pair attempt times out before a prefix-sum reference.

Three solutions cover subset XOR, alternating swaps and mutable pair counts; the last records a time-limit-exceeded DP attempt for visible sticks.

Four solutions find the busiest year, maximize distance between arrays, compute a subarray min-product, and topologically count colours in a DAG.

Solutions for thesis references: author-name casing, multi-author abbreviation, conference separators, and converting CNKI citations into Bib records.

Four solutions shift alternating characters, manage seats with a min-heap, maximize a capped increasing array, and answer closest-room queries offline.

Four solutions scan a nearest target, backtrack a descending split, combine next permutation with greedy swaps, and match shortest intervals offline.

Four solutions convert bases, raise frequency with a sliding window, find five ordered vowel runs, and maximize height between sparse limits.

The upsolving notes cover increasing substrings and arithmetic progressions, including a type-conversion bug and an approach that timed out.

Four solutions check a pangram, buy cheap ice creams, schedule a single-threaded CPU, and reduce pairwise AND-XOR to independent bit counts.