Viewing insights from Codeforces 1859C: Another Permutation Problem that are similar (thus shared) with only this insight from Codeforces 1860D: Balanced String: Think about the constraints. Why n=100? If it was a greedy, or prefix sum, or segment tree problem, n would probably be larger. by Solarion
- It was surprisingly easy problem because of the the small range of the variable n (n <= 250) and that allowed a brute force approach that I've considered, but still looking for a more efficient solution even though O(n^2) or O(n^3) are super efficient. Keep in mind that not every problem has tricks by alextm
Page 1 of 1.
View links to all pages
1About • Privacy Notice • Rules • Problems list • Journal • Your profile • GitHub
Moon Symbol icon by Icons8 • Sun icon by Icons8 • Emojis from Twemoji by Twitter under CC by 4.0