slide A -> D means skipping B and C and only values on A and D are counted, B and C are not counted and the path length in case you slide A-> D is 2 and when you go A->B->C->D is 4.
direction in which I am thinking is that maybe I could compute max and min rang query matrix and then from both sides start and end somehow figure out the outer boundaries .... but as QM said i see no way to avoid full all-pair traversal of the matrix ... also i am thinking in direction of maybe starting the taversal from the highest value in the matrix and working my way to reach start and end point but i am not sure if this is a good way to go...
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|