## P6185 [NOI Online #1 enhancement group] sequence

Given two sequences of length n \ (A \), \ (B \).
There are m available actions \ ((t_i,u_i,v_i) \).
\(t \) represents the type of operation.
When \ (t=1 \), it means that both \ (a {u_i} \) and \ (a {v_i} \) can be \ (+ 1 \);
When \ (t=2 \), it means that one of \ (a {u_i} \) and \ (a {v_i} \) can be \ (+ 1 \) and the other \ (- 1 \);
There is ...

Posted by **mrobertson** on *Wed, 10 Nov 2021 20:01:48 +0100*

## CF1286E Fedya the Potter Strikes Back

\(\Large\texttt{CF1286E Fedya the Potter Strikes Back
}\)
It is expected that the theoretical complexity is \ (\ mathcal O(n\alpha(n)) \) and theoretically the table calculation is suspended, but it seems that it is actually not better than the submission of some \ (\ mathcal O(n\log n) \).
thinking
For the answer that we need to maintain dynam ...

Posted by **chandan_tiwari** on *Sun, 07 Nov 2021 00:37:35 +0100*