×

# [Help]How can this problem be solved ?

 0 I am working on this problem . As I am a newbie in algorithm designing , I wanted to know how can we solve this problem. Please help me in figuring this out in brief. P.S. - A tutorial can be a great help for many other people like me who wants to learn. Thanks In Advance. asked 29 Jun '15, 01:56 240●3●9●32 accept rate: 5%

 0 The solution is pretty straight forward - solution answered 29 Jun '15, 03:20 534●2●16 accept rate: 12% brute force passing?? wow (29 Jun '15, 12:41)
 0 you can solve it by using segment tree. For more detail plz see this link:-https://www.topcoder.com/community/data-science/data-science-tutorials/range-minimum-query-and-lowest-common-ancestor/ answered 29 Jun '15, 08:01 -1●1 accept rate: 0%
 0 u can use two segment trees one for min and one for max. thats it done. answered 29 Jun '15, 12:46 204●3●12 accept rate: 7%
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×2,718
×1,912
×1,477
×706

question asked: 29 Jun '15, 01:56

question was seen: 1,078 times

last updated: 29 Jun '15, 12:46