Re: [algogeeks] Re: SPOJ problem-BRCKTS

2011-03-23 Thread bharath kannan
i found this good.. http://www.topcoder.com/tc?module=Staticd1=tutorialsd2=lowestCommonAncestor On Mon, Mar 21, 2011 at 6:02 PM, Anurag atri anu.anurag@gmail.comwrote: yes , please suggest a nice tutorial for segment trees .. On Mon, Mar 21, 2011 at 5:48 PM, cegprakash

Re: [algogeeks] Re: SPOJ problem-BRCKTS

2011-03-23 Thread bharath kannan
but..i read this oly after my senior taught me segment trees.. On Wed, Mar 23, 2011 at 4:43 PM, bharath kannan bharathgo...@gmail.comwrote: i found this good.. http://www.topcoder.com/tc?module=Staticd1=tutorialsd2=lowestCommonAncestor On Mon, Mar 21, 2011 at 6:02 PM, Anurag atri

Re: [algogeeks] Re: SPOJ problem-BRCKTS

2011-03-23 Thread Arpit Sood
in the topcoder tutorial of the segment trees, the value of the M[node] should be modified during query, we only need to return it. Just a correction, people have mentioned it in forum also. On Wed, Mar 23, 2011 at 4:46 PM, bharath kannan bharathgo...@gmail.comwrote: but..i read this oly after

Re: [algogeeks] Re: SPOJ problem-BRCKTS

2011-03-23 Thread Arpit Sood
oops, i mean it shouldn't be modified. On Wed, Mar 23, 2011 at 6:56 PM, Arpit Sood soodfi...@gmail.com wrote: in the topcoder tutorial of the segment trees, the value of the M[node] should be modified during query, we only need to return it. Just a correction, people have mentioned it in

[algogeeks] Re: SPOJ problem-BRCKTS

2011-03-21 Thread cegprakash
hey i want to learn segment trees.. suggest me a tutorial plz.. pdf or word anything.. i don't understand wiki page -- 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

Re: [algogeeks] Re: SPOJ problem-BRCKTS

2011-03-21 Thread Anurag atri
yes , please suggest a nice tutorial for segment trees .. On Mon, Mar 21, 2011 at 5:48 PM, cegprakash cegprak...@gmail.com wrote: hey i want to learn segment trees.. suggest me a tutorial plz.. pdf or word anything.. i don't understand wiki page -- You received this message because you are

[algogeeks] Re: SPOJ problem-BRCKTS

2011-03-19 Thread cegprakash
could someone plz help me with a pdf for learning segment tree? i don't understand the wiki page -- 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,

[algogeeks] Re: SPOJ problem-BRCKTS

2011-03-19 Thread cegprakash
could someone plz help me with a pdf for learning segment tree? i don't understand the wiki page -- 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,

Re: [algogeeks] Re: SPOJ problem-BRCKTS

2011-03-19 Thread murthy.krishn...@gmail.com
can any 1 explain why we have 2 use segment trees ?? I am under the impression that in order to distinguish correct bracket expressions, we can just count the number of left brackets and compare that with the number of right brackets, if they are equal then it is a correct bracket expression.

Re: [algogeeks] Re: SPOJ problem-BRCKTS

2011-03-19 Thread Anurag atri
@Krishna }{ what about this case ? On Sun, Mar 20, 2011 at 2:11 AM, murthy.krishn...@gmail.com murthy.krishn...@gmail.com wrote: can any 1 explain why we have 2 use segment trees ?? I am under the impression that in order to distinguish correct bracket expressions, we can just count the

Re: [algogeeks] Re: SPOJ problem-BRCKTS

2011-03-19 Thread bharath kannan
http://www.spoj.pl/forum/viewtopic.php?f=3t=5240p=20667hilit=BRCKTS#p20667 if u know d basics of segment tree..then this thread will help for solving this prob :) On Sun, Mar 20, 2011 at 2:11 AM, murthy.krishn...@gmail.com murthy.krishn...@gmail.com wrote: can any 1 explain why we have 2 use