PL-OM 1982 Problem 1

Find a way of arranging $n$ girls and $n$ boys around a round table for which $d_n-c_n$ is maximum, where dn is the number of girls sitting between two boys and $c_n$ is the number of boys sitting between two girls.