| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
|
0
Yeah i got it now. We can only decrement aij once. |
|
0
We have to output the minimum maximum value right? |
|
0
Yeah. Suppose the max element in matrix is 9 and rest of the elements are 5. 5 5 5 9 5 5 Now we can choose r=2 and c=1 and ans will be 7 but according to algorithm we get 8. if maxx=largest element in matrix and secondMaxx= 2nd largest then, I tried writing two diff cases for when maxx-secondMaxx>1 and maxx-secondMaxx==1. Even in the first test case 1 1 1 The answer should be -1 right? After choosing r=1 and c=1. Can anyone please explain where I have gone wrong? |
| Name |
|---|


