摘要：
[USACO07DEC] Sightseeing Cows G 题目描述 Farmer John has decided to reward his cows for their hard work by taking them on a tour of the big city! The cows 阅读全文
摘要：
G. Bicycles All of Slavic's friends are planning to travel from the place where they live to a party using their bikes. And they all have a bike excep 阅读全文
摘要：
E2. Game with Marbles (Hard Version) The easy and hard versions of this problem differ only in the constraints on the number of test cases and $n$. In 阅读全文
摘要：
C. Heavy Intervals You have $n$ intervals $[l_1, r_1], [l_2, r_2], \dots, [l_n, r_n]$, such that $l_i < r_i$ for each $i$, and all the endpoints of th 阅读全文
摘要：
D. Yet Another Inversions Problem You are given a permutation $p_0, p_1, \ldots, p_{n-1}$ of odd integers from $1$ to $2n-1$ and a permutation $q_0, q 阅读全文
摘要：
G2. Light Bulbs (Hard Version) The easy and hard versions of this problem differ only in the constraints on $n$. In the hard version, the sum of value 阅读全文
摘要：
E. Physical Education Lessons This year Alex has finished school, and now he is a first-year student of Berland State University. For him it was a tot 阅读全文
摘要：
D. Array Collapse You are given an array $[p_1, p_2, \dots, p_n]$, where all elements are distinct. You can perform several (possibly zero) operations 阅读全文
摘要：
D. Cyclic MEX For an array $a$, define its cost as $\sum_{i=1}^{n} \operatorname{mex} ^\dagger ([a_1,a_2,\ldots,a_i])$. You are given a permutation$^\ 阅读全文
摘要：
C - Not So Consecutive Problem Statement You are given an integer $N$. An integer sequence $x=(x_1,x_2,\cdots,x_N)$ of length $N$ is called a good seq 阅读全文