Codeforces Round #725 (Div. 3) ABCDEFG Solutions (Java/C++)
A. Stone Game Solution: Let us find the position of minimum and maximum value. Then there are 4 ways to remove: remove from left to right.remove from right to left.…
Codeforces Round #724 ABCDE Solutions (Java/C++)
A. Omkar and Bad Story Solution: Obviously, if there is any number in the array is less than zero. Then by using this number as the subtracted number, the array can grow indefinitely.…
Codeforces Round #724 Omkar and Forest Solution (Java/C++)
Solution: There are two conclusions: For any point of the map, assume the value of this point is x. So, there must a path from this point, and the value of…
Codeforces Round #724 Omkar and Medians Solution (Java/C++)
Solution: First, we can find that: for b[i+1], compare to b[i], actually, we add two number to a: a[2i+1] and a[2i]. So, the impact to the median is limited to 1 position.…
Educational Codeforces Round 110 ABCDE Solutions (Java/C++)
A. Fair Playoff Solution: Just check whether the two winners are the first two largest after sorted or not. Code: Java C++…
Educational Codeforces Round 110 Gold Transfer Solution (C++ only)
Solution: First. Because the cost of child node must higher that their father node. So obviously, we will choose the shallower node. Then we need find the shallowest node which still have gold remained.…
Educational Codeforces Round 110 Playoff Tournament Solution (Java/C++)
Solution: Like segment tree. Maintain all the possibilities of the current game and the earlier game. For sample data, the Initial state:…
Educational Codeforces Round 110 Unstable String Solution (Java/C++)
Solution: First, consider if the string is unstable, then how many substrings is beautiful. For 010101, we found it can have 6 substrings which length is 1…
