Sixty points, of which thirty are coloured red, twenty are coloured blue and ten are coloured green, are marked on a circle. These points divide the circle into sixty arcs. Each of these arcs is assigned a number according to the colours of its endpoints: an arc between a red and a green point is assigned a number $1$, an arc between a red and a blue point is assigned a number $2$, and an arc between a blue and a green point is assigned a number $3$. The arcs between two points of the same colour are assigned a number $0$. What is the greatest possible sum of all the numbers assigned to the arcs?
Let $W$ be function which assign to each red/green/blue point value $1/0/3$. By this assigment we can generate proper assigment of arcs, if consecutive points on circle are $x_i$ and $x_{i+1}$ then we assign to arc beetwen them $|W(x_i)-W(x_{i+1})|$. So we want maximum value of $$ S= \sum_{i=1}^{60}|W(x_i)-W(x_{i+1})|$$ where $x_{61} =x_1$. Now we see that $S$ does not decrease if we have in a sequence two consecutive points of the same color, say with colors $a,a,b,c$, where $b,c$ can also be $a$ or can be the same colors $b=c$, by replacing $a$ and $b$: $$|a-a|+|a-b|+ |b-c|\leq |a-b|+|b-a|+|a-c|$$
So we see that the best arrangement of colors is if don't have consecutive points with the same color.
Have I missed something?
Edit: Thanks to Yorch