Debugging help with Codeforces Round 401 div2E

Revision en1, by memeset, 2017-03-05 22:59:53

Hi everyone, On the recent codeforces round, I can't for the life of me figure out why my code is wrong.

My approach is to first compress all of ai and bi into at numbers that are at most 2 * 105 and then store dp[i]=highest possible height obtainable with topmost ring with i inner width. I update this by iterating through the input by nonincreasing b, using a binary indexed tree to find the max of the elements from 1 to the compressed bi - 1 of dp.

Any help would be appreciated. Thanks!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English memeset 2017-03-06 10:56:51 247
en1 English memeset 2017-03-05 22:59:53 615 Initial revision (published)