Hi everyone,↵
On the recent codeforces round, I can't for the life of me figure out why my [code](http://mirror.codeforces.com/contest/777/submission/25272502) is wrong.↵
↵
My approach is to first compress all of $a_i$ and $b_i$ into at numbers that are at most $2*10^5$ 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 $b_i-1$ of dp.↵
↵
Any help would be appreciated.↵
↵
↵
EDIT: Hi everyone, I am curious as to why this post is being downvoted. I am not complaining, but I would like to know for the future, are these type of debugging posts frowned upon? If yes, where should I ask inquiries such as for debugging? Thanks!
On the recent codeforces round, I can't for the life of me figure out why my [code](http://mirror.codeforces.com/contest/777/submission/25272502) is wrong.↵
↵
My approach is to first compress all of $a_i$ and $b_i$ into at numbers that are at most $2*10^5$ 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 $b_i-1$ of dp.↵
↵
Any help would be appreciated.↵
↵
↵
EDIT: Hi everyone, I am curious as to why this post is being downvoted. I am not complaining, but I would like to know for the future, are these type of debugging posts frowned upon? If yes, where should I ask inquiries such as for debugging? Thanks!
