You are not logged in. Please login at www.codechef.com to post your questions!

×

[Help]How can this problem be solved ?

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

shubham99's gravatar image

2★shubham99
2403932
accept rate: 5%


The solution is pretty straight forward - solution

link

answered 29 Jun '15, 03:20

prrateekk's gravatar image

3★prrateekk
534216
accept rate: 12%

brute force passing?? wow

(29 Jun '15, 12:41) king_of_hacker3★
link

answered 29 Jun '15, 08:01

bhardwaj_75's gravatar image

4★bhardwaj_75
-11
accept rate: 0%

u can use two segment trees one for min and one for max. thats it done.

link

answered 29 Jun '15, 12:46

king_of_hacker's gravatar image

3★king_of_hacker
204312
accept rate: 7%

toggle preview
Preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • 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