| # | User | Rating |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 163 |
| 2 | maomao90 | 160 |
| 3 | adamant | 159 |
| 4 | maroonrk | 152 |
| 5 | -is-this-fft- | 150 |
| 6 | atcoder_official | 148 |
| 6 | SecondThread | 148 |
| 8 | nor | 147 |
| 9 | TheScrasse | 146 |
| 10 | Petr | 144 |
The 30692159 gives an error on test 9; if anyone can point out the mistake in the code i'd grateful.
Working:
I first formed an array that stores the maximum value of the input numbers upto the current index.
I then formed an array that stores the maximum value of p*ai+q*aj for a particular j.
I am stumped on 29958547. What is the error in the code which hasn't been discovered till test case 15. If the entire approach is wrong, please don't reveal the the correct approach, just say that the approach is wrong. However if a silly error has been committed please point it out.
