@va1ts7_100 posted a new topic, subject "segmented tree confirmation". It read:

   is it possible to have more than one segmented tree possible for an array of odd numbers(constructing segmented tree for summation of array elements)…?

So @eknoor292 replied

    That would probably depend on how you choose the mid of each segment while constructing the tree recursively. An example of what you have in mind will make the question more clear

So @va1ts7_100 replied

    i got the point…can you send the C code to construct segmented tree for sum array…? i didn't find it anywhere…plzz help… thanks…

To which @damn_me (Ekta Goel) replied

    Do you mean calculating sum of range using segmented array? If yes, you may refer http://e-maxx.ru/algo/segment_tree and http://www.geeksforgeeks.org/segment-tree-set-1-sum-of-given-range/


{'source': 'discourse', 'url': 'https://discuss.codechef.com/t/segmented-tree-confirmation/9230', 'title': 'segmented tree confirmation', 'views': 930, 'has_accepted_answer': False, 'word_count': 117, 'like_count': 0, 'reply_count': 2, 'participant_count': 3, 'posts': 4, 'tags': 'segment-tree', 'author': '@va1ts7_100', 'participants': '@va1ts7_100, @eknoor292, @damn_me (Ekta Goel)', 'image_url': [None], 'created_at': '2015-01-18T12:58:46.000Z', 'last_posted_at': '2015-01-19T19:30:04.000Z'}