Why is the answer 2 ^ ( n — 1 ) ?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Why is the answer 2 ^ ( n — 1 ) ?
Name |
---|
Suppose the correct answer for f(n) = k and we want to find out f(n+1)
One could either place the highest number i.e. (n+1) either towards the rightmost end in the permutation or towards the leftmost end to satisfy constraints "maximum element between the indices [i..j] is either present at index i, or at index j" to satisfy for [1...n]. The other inner constraints would automatically be satisfied as we know f(n) is true. So there are 2 possible choices. f(n+1) = 2*f(n)
Now the base case n = 1. There is only 1 choice so f(1) = 1. Kind of Mathematical Induction Proof :P
So a recurrence relation f(n) = 2*f(n-1) when n > 1. Solving this recurrence f(n) = 2**n-1
I cannot understand why is f(n+1) = 2*f(n) ?
Emm. Suppose the ans for n = 3 has these possibilities:
4 possible answers
Now i need to find ans for n = 4. So _ _ _ _. I can either place it at 1st index or 4th index to satisfy the property "maximum element between the indices [i..j] is either present at index i, or at index j" for range [1..4]
So the ans will be:
4 + 4 = 8 possible answers
excuse me , why did you not count these possibles in your answer??
4 2 3 1
4 1 3 2
1 3 2 4
2 3 1 4 ???
4 2 3 1
i=2,j=4 the maximum number is 3 which is neither in the ith nor in the jth position.
4 1 3 2
i=2,j=41 3 2 4
i=1,j=32 3 1 4
i=1,j=3