Round 967 (Div 2) Problem D [Test case needed]

Правка en2, от DhurBaal, 2024-09-07 10:29:09

Hi,

I am stuck at 2001D - Longest Max Min Subsequence. My logic is similar to other accepted solutions. Also, my solution works for all the small test cases I can find from other people's accepted solutions. Some test cases are big and truncated on CF, so I could not test my code with those cases.

Can someone please point out the bug/ provide a test case for which the code does not work?

Thanks in advance.

My submission: 280104081

my solution
Теги help, python3, heap, round 967

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский DhurBaal 2024-09-07 10:29:09 186 (published)
en1 Английский DhurBaal 2024-09-07 10:21:14 1672 Initial revision (saved to drafts)