### Maksim1744's blog

By Maksim1744, 12 months ago, Continuing with the theme of absent editorials for old rounds, here is an editorial for Codeforces Round #171 (Div. 2). Even though there is an official editorial, it is only in russian and doesn't have solution for the last problem.

A

Editorial
Code

B

Editorial
Code

C

Editorial
Code

D

Editorial
Code

E

Editorial
Code Tutorial of Codeforces Round #171 (Div. 2) Comments (6)
 » In problem C could you elaborate the last part of editorial
•  » » Let's look at $tol[i]$. If $a[i - 1] < a[i]$, then $tol[i] = i$, otherwise $a[i - 1] \geqslant a[i]$ and we can continue longest nonincreasing sequence which ends in $a[i - 1]$ by adding $a[i]$, so $tol[i] = tol[i - 1]$.
 » Is the optimal time complexity of problem B O(n^2) or O(nlogn)?
•  » » O(n) using sliding window technique
 » 9 months ago, # | ← Rev. 2 →   Problem B. Here is my code that uses binary search for those newbies who need :v 142603853
•  » » 7 months ago, # ^ | ← Rev. 2 →   Bro ur binary search technique is sike af !! amazing bro !