AFGhazy's blog

By AFGhazy, history, 9 years ago, In English

http://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.

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
9 years ago, # |
Rev. 3   Vote: I like it +3 Vote: I do not like it

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 любит физику 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