@atul anand : it will work,i can give u the code.
On Mon, Mar 12, 2012 at 11:53 AM, sanjiv yadav <sanjiv2009...@gmail.com>wrote:
> u r right.........
>
>
> On Mon, Mar 12, 2012 at 11:17 AM, atul anand <atul.87fri...@gmail.com>wrote:
>
>> @sanjiv : wont work for this test case :-
>>
>> {1,5,3,6,2,7,8};
>>
>>
>> On Mon, Mar 12, 2012 at 10:54 AM, sanjiv yadav
>> <sanjiv2009...@gmail.com>wrote:
>>
>>> @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 <atul.87fri...@gmail.com>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 <pkjee2...@gmail.com>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 algogeeks@googlegroups.com.
>>>>> To unsubscribe from this group, send email to
>>>>> algogeeks+unsubscr...@googlegroups.com.
>>>>> 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 algogeeks@googlegroups.com.
>>>> To unsubscribe from this group, send email to
>>>> algogeeks+unsubscr...@googlegroups.com.
>>>> For more options, visit this group at
>>>> http://groups.google.com/group/algogeeks?hl=en.
>>>>
>>>
>>>
>>>
>>> --
>>> Regards....
>>>
>>> Sanjiv Yadav
>>>
>>> MobNo.- 8050142693
>>>
>>> Email Id- sanjiv2009...@gmail.com
>>>
>>> --
>>> You received this message because you are subscribed to the Google
>>> Groups "Algorithm Geeks" group.
>>> To post to this group, send email to algogeeks@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> 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 algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> Regards....
>
> Sanjiv Yadav
>
> MobNo.- 8050142693
>
> Email Id- sanjiv2009...@gmail.com
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
*Regards,*
*Piyush Kapoor,*
*2nd year,CSE
IT-BHU*
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
