http://mirror.codeforces.com/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 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
http://mirror.codeforces.com/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.
Name |
---|
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