/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

0 vote321 views1 answer
Java 1.8.0 (64 bit) free download
Java
0 vote350 views1 answer
How to remove spaces from an array in java
Java
3 votes477 views2 answers
Spring boot example with swagger
Java Spring
20 votes340 views4 answers
Android java toast
Java
53 votes324 views3 answers
Calculate number of years months and days between two dates in java
Java
3 votes324 views1 answer
Fibunacci java
Java
0 vote323 views1 answer
Android studio proportional width
Java
10 votes327 views2 answers
Finding absolute value in java
Java
135 votes518 views6 answers
Java random number generator
Java
23 votes346 views1 answer
Boootstrap alerts
Java