http://codeforces.me/contest/445/problem/C
can any one explain the problem and the answer for me ? the tutorial and the problem statement are so mysterious for me thanks in advance.
http://codeforces.me/contest/445/problem/C
can any one explain the problem and the answer for me ? the tutorial and the problem statement are so mysterious for me thanks in advance.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
A similar but quite easy question :
Q : Find the maximum average subset/sub-array of a given array ? Ans : Maximum Number in Array.
445C - DZY Loves Physics is just a graphical version of this question. But for 1 node,ans is defined to be 0 instead of oo. Hence you pick 2 nodes for which (x[a[i]] + x[b[i]]) / c[i] is maximum