/Java/Candies price hackerearth solution in java

Candies price hackerearth solution in java

import java.util.Scanner;

class AliceAndCandy {
	public static void main(String args[]) throws Exception {
		Scanner scan = new Scanner(System.in);
		int length = scan.nextInt();

		int[] children = new int[length];
		int[] candies = new int[length];

		// seed
		children[0] = scan.nextInt();
		candies[0] = 1;

		// search forward sequences
		for (int i = 1; i < length; i++) {
			children[i] = scan.nextInt();
			candies[i] = 1;
			if (children[i] > children[i - 1])
				candies[i] = candies[i - 1] + 1;
		}

		// search reverse sequences
		for (int i = length - 1; i > 0; i--) {
			if (children[i] < children[i - 1])
				candies[i - 1] = Math.max(candies[i - 1], candies[i] + 1);
		}

		long sum = 0;
		for (int i = 0; i < candies.length; i++) {
			sum += candies[i];
		}

		System.out.println(sum);
		scan.close();
	}
}

Source: gist.githubusercontent.com

Similar codes

-2 votes156 views2 answers
Ceil function in java
Java
4 votes176 views1 answer
Read integer input java
Java
1 vote165 views1 answer
How to break switch case in java
Java
1 vote191 views1 answer
Java date to string yyyy-mm-dd
Java
11 votes166 views1 answer
Java make sure only one condition is true
Java
2 votes177 views1 answer
What is an error in Java
Java
3 votes227 views2 answers
Xml definition file for spring
Java Spring
0 vote180 views1 answer
Android send fragment context
Java
0 vote162 views1 answer
Iterade dict javacirpt
Java
0 vote173 views1 answer
Java timer schedule every day
Java