/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 votes105 views1 answer
Android check if app is running
Java
0 vote59 views1 answer
Lmethod java
Java
1 vote115 views1 answer
Admost track purchase
Java
0 vote97 views2 answers
Open google maps cycling navigation intent
Java
7 votes101 views1 answer
Java insert into arraylist
Java
1 vote100 views1 answer
Boolean java.lang.String.equals(java.lang.Object)' on a null object reference
Java
0 vote95 views1 answer
Using java stream filter to find the sum of property
Java
0 vote100 views1 answer
Android studio fecth audio from app directory
Java
0 vote100 views1 answer
Goodbye java
Java
0 vote98 views1 answer
Javalin pom
Java