@atul anand- It will still work as follows---
(3,0)
/ \(5,0+3)
(1,0) \(6,0+3+5)
\(2,0+1) \(7,0+3+5+6)
\(8,0+3+5+6+7)
here, my logic is that if number is grater than its parent,then add the
parent in the current sum,else keep it as such.
check it and made correction in my logic if i m wrong.
On Mon, Mar 12, 2012 at 10:33 AM, atul anand <[email protected]>wrote:
> @piyush : i dont think so BIT would work over here , we are not just
> reporting cumulative sum tilll index i.
>
> On Mon, Mar 12, 2012 at 12:58 AM, Piyush Kapoor <[email protected]>wrote:
>
>> This can be done very easily with the help of a Binary Indexed Tree,and
>> it is very short to code as well.Simply process the numbers in order,and
>> for each number output the cumulative frequency of the index of the number
>> you are processing.
>>
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to [email protected].
>> To unsubscribe from this group, send email to
>> [email protected].
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected].
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards....
Sanjiv Yadav
MobNo.- 8050142693
Email Id- [email protected]
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
