Need help in this problem. What is the formula? Thanks in Advance.
Need help in this problem. What is the formula? Thanks in Advance.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
8 | SecondThread | 146 |
10 | pajenegod | 145 |
Название |
---|
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.