Candy (leetcode)

题目：

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?

题目来源：https://oj.leetcode.com/problems/candy/

解题思路：《leetcode题解》从前往后扫描一遍，遇到上升部分，就赋值给increase数组当时需要的最少糖果数，然后从后往前扫描一遍，遇到上升部分，就重新赋值increase数组需要的最少糖果数，因为要保证每个小朋友最少有一个糖果，所以从后往前扫描时，需要取当时inc和increase的最大值。注意由于result初始化为N，因此，扫描时最低点小朋友的糖果数其实是0.

#include<iostream>
#include<vector>
using namespace std;

int candy(vector<int> &ratings)
{
	if(ratings.empty())
		return 0;
	int result=ratings.size(),inc=1;
	vector<int> increase(ratings.size(),0);
	for(int i=1;i<ratings.size();i++)
		if(ratings[i]>ratings[i+1])
			increase[i]=max(inc++,increase[i]);
		else
			inc=1;
	inc=1;
	for(int i=ratings.size()-2;i>=0;i--)
		if(ratings[i]>ratings[i-1])
			increase[i]=max(inc++,increase[i]);
		else
			inc=1;
	for(int i=0;i<increase.size();i++)
		result+=increase[i];
	return result;
}

int main()
{
	const int N=3;
	int A[]={2,2,1};
	vector<int> ratings(A,A+N);
	int result=candy(ratings);

	system("pause");
	return 0;
}