Need help in this problem. What is the formula? Thanks in Advance.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Need help in this problem. What is the formula? Thanks in Advance.
Name |
---|
The problem is simple, It requires to know the concept of median. Well the approach is: We sort all the positions. Then We Can say that the fucka point lies in the range of middle two elements.
Now the probabilty(ans) is : (length of the segment between two mid points)/m
ie after sorting ans is: (a[n/2]-a[(n-1)/2])/m;
The proof is easy to realise by writing the expression for distance and see that median always satisfy the condition.