Another version of problem E of Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2)

Revision en1, by Fearless_cod, 2021-07-23 07:23:33

In** problem E** of yesterday's round, I misread the question and thought of a completely different problem the whole time. But this problem might also be interesting for some of you guys. So, here goes the modification:- Instead of swapping any two elements, you can swap only two adjacent elements and the constraint on** m is <=n**.

I can share my idea and code also for this problem which I think works. Meanwhile, if any of you guys know any links where we can submit this problem, please share it.

Thanks for reading.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Fearless_cod 2021-07-23 07:24:38 13 Tiny change: 'traint on **m**<=**n**.\n\nI can' -> 'traint on m is m<=n.\n\nI can'
en2 English Fearless_cod 2021-07-23 07:24:17 10 Tiny change: 'straint on** m is <=n**.\n\nI ' -> 'straint on **m**<=**n**.\n\nI '
en1 English Fearless_cod 2021-07-23 07:23:33 659 Initial revision (published)