candies.java

import java.util.*;
public class candies
{

public static void main(String ar[])throws Exception
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int res;
int rat[]=new rat[n];
for(int i=0;i<n;i++)
rat[i]=sc.nextInt();
res=candies.candy(rat);
System.out.println("minimum number of candies is:"+res);
}
public int candy(int[] ratings) {
	if (ratings == null || ratings.length == 0) {
		return 0;
	}
 
	int[] candies = new int[ratings.length];
	candies[0] = 1;
 
	//from let to right
	for (int i = 1; i < ratings.length; i++) {
		if (ratings[i] > ratings[i - 1]) {
			candies[i] = candies[i - 1] + 1;
		} else { 
			// if not ascending, assign 1
			candies[i] = 1;
		}
	}
 
	int result = candies[ratings.length - 1];
 
	//from right to left
	for (int i = ratings.length - 2; i >= 0; i--) {
		int cur = 1;
		if (ratings[i] > ratings[i + 1]) {
			cur = candies[i + 1] + 1;
		}
 
		result += Math.max(cur, candies[i]);
		candies[i] = cur;
	}
 
	return result;
}

}