There are N children standing in a line. Each child is assigned a rating value.
You are giving candies to these children subjected to the following requirements:
- Each child must have at least one candy.
- Children with a higher rating get more candies than their neighbors.
What is the minimum candies you must give?
有N个小孩站成一排,每个小孩都有一个等级。
根据以下规则给这些孩子发糖果:
1.每个孩子至少有一个糖果
2.高等级的孩子获得的糖果要比旁边低等级的多。
求最少给多少个糖果
解法:动态规划是当前状态受前一个状态影响的。这个问题是当前状态受前后两个状态影响,可以氛围正序和倒序两个动态规划配合。
正序遍历判断等级高的前一个的糖果数+1,其他的都是1。倒序遍历判断等级高的,且糖果不多的,改为后一个的糖果数+1
<?php
function candy($arrRate) {
$arrCandy = array(1);
$num = count($arrRate);
for ($i = 1; $i < $num; $i ++) {
if ($arrRate[$i] > $arrRate [$i - 1]) {
$arrCandy[$i] = $arrCandy[$i - 1] + 1;
} else {
$arrCandy[$i] = 1;
}
}
for ($i = $num - 2; $i >= 0 ;$i --) {
if ($arrRate[$i] > $arrRate [$i + 1] && $arrCandy[$i] <= $arrCandy[$i + 1]) {
$arrCandy[$i] = $arrCandy[$i + 1] + 1;
}
}
print json_encode($arrCandy)."\n";
$allCandy = array_sum($arrCandy);
return $allCandy;
}
$array = array(10,3,4,5,6,3,5,5,6,4);
$ret = candy($array);
print $ret;