It's an old olympiad from Korea in 2011, so I guess yes everybody is allowed to look for external help.
There are 3 terms, the maximum of each term is 1/5 (when a, b, or c =2), obtained by a simple derivation.
As a or b or c tends to infinite, every terms tends to 0. My reasoning is intuitive : a+b+c = 1, and in order to maximize the sum of the terms, I would be as close possible as the value 2. By choosing (2/2/-3), or any combination of these, I get 13/30 as a maximum, which is higher than other combinations i tried by getting further (eg. 3/1/-3, etc.). I am just stuck on how i should begin to prove this.