muchia 5 (1 -> 5): (1 * 2) % 100003 = 2
Permutarea optima este: 4 5 2 1 6 3

<tex> \sum_{i=1}^{N} dist(i, p(i)) = 2 + 2 + 4 + 2 + 2 + 4 = 16</tex> si este maxima
Sirul de perechi este: { ({0, 2}, 4) , ({0, 2}, 5) , ({2, 0, 2, 4}, 2) , ({2, 0}, 1) , ({5, 0}, 6) , ({4, 2, 0, 5}, 3) }

<tex> \sum_{i=1}^{6} dist(i, p(i)) = 2 + 2 + 4 + 2 + 2 + 4 = 16</tex> si este maxima
Sirul de perechi este: ${ ({0, 2}, 4) , ({0, 2}, 5) , ({2, 0, 2, 4}, 2) , ({2, 0}, 1) , ({5, 0}, 6) , ({4, 2, 0, 5}, 3) }$ si este minim lexicografic

== include(page="template/taskfooter" task_id="dedicatie") ==