  In this short note we determine the maximum number, over all $n$-vertex
graphs $G$, of orientations of $G$ containing no strongly connected cycle
$C_{2k+1}$. This answers a part of a recent question of Araujo, Botler and
Mota.
