GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — algorithms/java/Candies.java at master · lntutor/algorithms

Expand file tree

/

Candies.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
41 lines (35 loc) · 910 Bytes
/

Candies.java

Copy path

File metadata and controls

41 lines (35 loc) · 910 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
// https://www.hackerrank.com/challenges/candies
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader ob = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(ob.readLine());
int [] rate = new int[n];
for (int i = 0; i < n; i++) {
rate[i] = Integer.parseInt(ob.readLine());
}
int [] candy = new int[n];
candy[0] = 1;
for (int i = 1; i < n; i++) {
if (rate[i] <= rate[i-1]) {
candy[i] = 1;
} else if (rate[i] > rate[i-1]) {
candy[i] = candy[i-1] + 1;
}
}
for (int i = n-2; i >=0; i--) {
if (rate[i] > rate[i+1] && candy[i] <= candy[i+1]) {
candy[i] = candy[i + 1] + 1;
}
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum += candy[i];
}
System.out.println(sum);
}
}
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.