Viewing insights from Codeforces 1859C: Another Permutation Problem 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
- 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
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