Soldiers in a Line

Source: Alok Goyal's Puzzle Page

Problem:
In a line up of 10 soldiers, what is the least number of soldiers that can be picked in order of either ascending or descending heights? Assume that no two soldiers have the same height. Soldiers can be picked from anywhere in the line, but their order of standing cannot be changed.


Comments

  1. Unknown6:38 PM, September 14, 2015

    If one does not pick any soldiers then the answer is 0. In what way are we picking the soldiers ?

    ReplyDelete
  2. Vineet Goyal8:47 PM, September 19, 2015

    Assuming we picker can preprocess the heights before selecting, the least number of soldiers that can be picked in either descending or ascending order would be 2.

    this scenarios would occur when you pick the first guy as the 5 highest person then try to oscillate between picking the descending and ascending options.

    Something like this pattern would occur : /\/\/\/\/

    ReplyDelete
  3. Unknown12:13 AM, September 20, 2015

    4. This is essentially asking to prove the Erdos-Szekeres Theorem.

    ReplyDelete
  4. Unknown12:45 AM, September 20, 2015

    In other words, we want to find the minimum number k such that, for any permutation of 10 elements, we can always either find an increasing subsequence of length k, or a decreasing subsequence of length k.

    Given a permutation, we can build a standard Young tableau using the Schensted correspondence:
    https://en.wikipedia.org/wiki/Robinson%E2%80%93Schensted_correspondence

    This tableau has the property that the length of longest increasing subsequence is the length of the first row (or equivalently, the number of columns), and the length of the longest descreasing subsequence is the height of the first column (or equivalently, the number of lines).

    Since a tableau with 10 elements necessarily has either at least 4 lines or at least 4 columns, the number k we are looking for is 4.

    More generally, for N soldiers, the numbers is ceil(sqrt(N)).

    ReplyDelete
    Replies
    1. Anoopam Agarwal2:29 PM, February 21, 2016

      Is there an algorithm for constructing this permutation ?

      Delete
  5. Unknown6:29 PM, January 16, 2016

    For any general N,answer is the sequence with ceil(sqrt(N)) decreasing subsequences:
    (ceil(sqrt(N)),1) , (2*ceil(sqrt(N)),ceil(sqrt(N))+1), ....(i*ceil(sqrt(N)),(i-1)*ceil(sqrt(N))+1) .... (N,(ceil(sqrt(N))-1)*ceil(sqrt(N))+1)
    which will essentially give maximum ceil(sqrt(N)) sized increasing/decreasing subsequences.
    For example,for N=15: 4 3 2 1 8 7 6 5 12 11 10 9 15 14 13

    ReplyDelete

Post a Comment

Popular posts from this blog

Fraction Brainteaser

Source: Sent to me by Gaurav Sinha Problem: Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20 out of 28 Geometry questions.  In total, Siddhant scores 25 out of 34.  Vaibhav writes another Maths test and correctly answers 20 out of 25 Arithmetic questions and 6 out of 9 Geometry questions. in total, Vaibhav scores 26 out of 34. Note that a) Vaibhav scores more than Siddhant b) Siddhant score better than Vaibhav in both individual topics -  5/6 > 20/25 and 20/28 > 6/9 How is it possible? 
Read more

Buying Dimsums

Source: Alok Goyal (Stellaris VP, Ex-Helion VC) puzzle blog Problem: A fast food restaurant sells dimsums in boxes of 7 and 3. What’s the greatest number of dimsums a person cannot buy. Generalize it for p and q where p and q are relatively prime. I loved the puzzle. Hope you enjoy it too.
Read more

Consecutive Heads

Let's say A keep tossing a fair coin, until he get 2 consecutive heads, define X to be the number of tosses for this process; B keep tossing another fair coin, until he get 3 consecutive heads, define Y to be the number of the tosses for this process. 1) Calculate P{X>Y} 2) What's the expected value of X 3) What's the expected value of Y This is probably the hardest puzzle I have ever put on my blog. Hence, I will post its solution in the post directly rather than on comment. Solution: 1) (Solved by me finally after 13 months :)) Make a state diagram. Let the state be (a,b) where a is the number of consecutive heads streak "A" is on currently and b is the number of consecutive heads streak "B" is on currently. So, (0,3) (1,3) are final accepted states and (2,0) (2,1) (2,2) (2,3) are failure states. If you get tails, your contribution to the state reaches to "0" f(State) = P(X>Y | "State" configuration initially)
Read more