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

×

[closed] HILLJUMP Editorial

Can any one explain approach of HILLJUMP problem please? I tried DP, along with segment tree and binary jumping method(not sure what we call it actually) and lazy propagation, but could not find out reasonable time complexity.. Please Help.. I can show my detailed approach but I don't think that would matter. Please help.. :(

asked 18 Aug '17, 15:08

kauts_kanu's gravatar image

5★kauts_kanu
1.0k19
accept rate: 19%

closed 18 Aug '17, 15:43

2

Deleting the post. Let us make the discussion on the editorial page itself.

(18 Aug '17, 15:38) dpraveen ♦♦4★

The question has been closed for the following reason "User requested" by kauts_kanu 18 Aug '17, 15:43

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:

×1,404
×1,291
×193
×24

question asked: 18 Aug '17, 15:08

question was seen: 334 times

last updated: 18 Aug '17, 15:43