<?php
function solution($A) {
$n = sizeof($A);
$result = 0;
for ($i = 0; $i < $n - 1; $i++) {
if ($A[$i] == $A[$i + 1])
$result = $result + 1;
}
$r = 0;
for ($i = 0; $i < $n; $i++) {
$count = 0;
if ($i > 0) {
if ($A[$i - 1] != $A[$i])
$count = $count + 1;
else
$count = $count - 1;
}
if ($i < $n - 1) {
if ($A[$i + 1] != $A[$i])
$count = $count + 1;
else
$count = $count - 1;
}
$r = max($r, $count);
}
return $result + $r;
}
$A[0] = 1;
$A[1] = 1;
$A[2] = 0;
$A[3] = 1 ;
$A[4] = 0 ;
$A[5] = 0;
print_r(solution($A));
- Output for 4.3.0 - 4.3.11, 4.4.0 - 4.4.9, 5.0.0 - 5.0.5, 5.1.0 - 5.1.6, 5.2.0 - 5.2.17, 5.3.0 - 5.3.29, 5.4.0 - 5.4.45, 5.5.0 - 5.5.38, 5.6.0 - 5.6.40, 7.0.0 - 7.0.33, 7.1.0 - 7.1.33, 7.2.0 - 7.2.33, 7.3.0 - 7.3.33, 7.4.0 - 7.4.33, 8.0.0 - 8.0.30, 8.1.0 - 8.1.28, 8.2.0 - 8.2.18, 8.3.0 - 8.3.6
- 4
preferences:
274.47 ms | 406 KiB | 460 Q