Substring Reversal

Revision en1, by tbquan08hanoi, 2024-04-01 16:14:36

Hi Codeforces community!

I was doing a problem like this: Given a string s, reverse a substring of it in each query, and print the final string after all queries. Constraints are 1 ≤ |S|, Q ≤ 10^5. I have seen many solutions using tree algorithms, is it possible to solve this problem without using tree algorithms?

Thanks!

Tags string, dp, tree, range query

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English tbquan08hanoi 2024-04-01 16:14:36 360 Initial revision (published)