2.1.22—线性表—Candy

描述
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?

#include<iostream>using namespace std;int Candy(int a[], int n){int result = 0;int *candy = new int[n];for (int i = 0; i < n; i++)candy[i] = 1;for (int i = 1; i < n; i++){if (a[i]>a[i - 1])candy[i] = candy[i - 1] + 1;}for (int i = n - 2; i >= 0; i--){if (a[i]>a[i + 1])candy[i] = (candy[i + 1] + 1>candy[i])?candy[i+1]+1:candy[i];}for (int i = 0; i < n; i++){result += candy[i];}delete candy;return result;}int main(){const int n = 13;int a[n] = { 1,2, 5, 8, 4, 3, 3,5,7,9,2,1,1 };int res = Candy(a, n);cout << res << endl;}