Viewing insights from Codeforces 1860D: Balanced String that are similar (thus shared) with only this insight from Codeforces 1859D: Andrey and Escape from Capygrad: In a problem involving intervals and the maximum point you can reach using intervals, consider using sweep line and finding intervals left of OR right of the current one. by mathmastersd
- 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
- The greedy solution of taking the maximum change close to your wanted 0 difference passes the pretests, but fails on the main tests. by Solarion
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