Here's a Problem from Atcoder beginner contest 154, I'm unable to understand the problem completely, I mean what they are asking and also the editorial, can someone explain the solution?
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 149 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | cry | 142 |
Here's a Problem from Atcoder beginner contest 154, I'm unable to understand the problem completely, I mean what they are asking and also the editorial, can someone explain the solution?
Name |
---|
I think you are not aware about the concept of Expected Value in probability.Read about it here. https://www.statisticshowto.com/probability-and-statistics/expected-value/
Now as each throw is independent so the expected value for any dice is (p+1)/2 where p is the maximum value a dice can show.This is because if a dice with maximum value p is thrown where each outcome is equally likely than expected value is:
1*(1/p)+2*(1/p)+....p*(1/p)=(p*(p+1))/(2*p)=(p+1)/2.
Now the question reduces to finding k consecutive elements in an array of size n(k<=n) which have maximum sum which can be done easily using prefix sums.Time Complexity being o(n).
Have a look at my code here https://ideone.com/QofY1S
Thank you for the detailed explanation. I got it completely. I thought we need to start taking element into consideration from k index (forgot it was k consecutive elements in the array). Again thank you.