**Candies**

### Problem Statement :

Alice is a kindergarten teacher. She wants to give some candies to the children in her class. All the children sit in a line and each of them has a rating score according to his or her performance in the class. Alice wants to give at least 1 candy to each child. If two children sit next to each other, then the one with the higher rating must get more candies. Alice wants to minimize the total number of candies she must buy. Example arr = [ 4, 6, 4, 5 , 6 , 2 ] She gives the students candy in the following minimal amounts: [ 1, 2, 1, 2, 3, 1 ] . She must buy a minimum of 10 candies. Function Description Complete the candies function in the editor below. candies has the following parameter(s): int n: the number of children in the class int arr[n]: the ratings of each student Returns int: the minimum number of candies Alice must buy Input Format The first line contains an integer, n , the size of arr. Each of the next n lines contains an integer arr[ i ] indicating the rating of the student at position i. Constraints 1 <= n <= 10^5 1 <= arr[ i ] <= 10^5 Sample Input 0 3 1 2 2 Sample Output 0 4

### Solution :

` ````
Solution in C :
In C :
#include <stdio.h>
#include <stdlib.h>
#define MAXN 100000
struct stu{
int id;
int rating;
};
int comp( const void*p1, const void*p2){
return ((struct stu*)p1)->rating - ((struct stu*)p2)->rating;
}
struct stu student[MAXN];
int candies[MAXN];
int ratings[MAXN];
int main(int argc, char *argv[])
{
int N;
int i,j;
int candy;
int id;
long long sumcandies = 0;
scanf("%d",&N);
for(i = 0; i < N; i++){
scanf("%d",&student[i].rating);
student[i].id = i;
ratings[i] = student[i].rating;
}
qsort(student,N,sizeof(struct stu),comp);
for(i = 0; i < N; i++){
id = student[i].id;
candy = 1;
if(id > 0){
if(candies[id-1] != 0 && ratings[id] > ratings[id-1]){
candy = candies[id-1] + 1;
}
}
if(id < N-1){
if(candies[id+1] != 0 && ratings[id] > ratings[id+1] &&
candy <= candies[id+1]){
candy = candies[id+1] + 1;
}
}
sumcandies += candy;
candies[id] = candy;
}
printf("%lld\n",sumcandies);
return 0;
}
```

` ````
Solution in C++ :
In C++ :
#include <cstdio>
#include <string>
using namespace std;
typedef long long ll;
int a[100005],b[100005];
inline int maxi(int x,int y) {
return (x>y)?x:y;
}
int main() {
int i,j,n;
ll ans;
scanf("%d",&n);
for (i=1;i<=n;++i) {
scanf("%d",&a[i]);
}
a[0]=a[1];
a[n+1]=a[n];
for (i=1;i<=n;++i) {
if ((a[i]<=a[i+1]) && (a[i]<=a[i-1])) {
b[i]=1;
for (j=i-1;j && (a[j]>a[j+1]);--j) {
b[j]=b[j+1]+1;
}
for (;i<n && (a[i+1]>a[i]);++i) {
b[i+1]=b[i]+1;
}
}
}
ans=0;
for (i=1;i<=n;++i) {
if ((a[i]>a[i-1]) && (a[i]>a[i+1])) {
b[i]=maxi(b[i-1],b[i+1])+1;
}
ans+=b[i];
}
printf("%Ld\n",ans);
return 0;
}
```

` ````
Solution in Java :
In Java :
import java.util.Scanner;
public class Solution{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int N, K;
N = in.nextInt();
//K = in.nextInt();
int C[] = new int[N];
for(int i=0; i<N; i++){
C[i] = in.nextInt();
}
int res[] = new int[N];
for(int i=0 ; i < N ;i++) res[i] =1 ;
int d = N ;
while(d <= N ){
boolean changed = false;
//forward
for(int i=1 ; i < N ;i++){
if(C[i-1] < C[i] && res[i-1] >= res[i] ){
res[i] = res[i-1] +1 ;
changed = true;
}
}
//backward
for(int i=N-1 ; i > 0 ;i--){
if(C[i-1] > C[i] && res[i-1] <= res[i] ){
res[i-1] = res[i] +1 ;
changed = true;
}
}
if(!changed)break;
}
int sum = 0;
for(int j : res ) sum += j;
System.out.println(sum);
}
}
```

` ````
Solution in Python :
In python3 :
N = int(input())
kids = []
for n in range(N):
kids.append(int(input()))
def candy(ratings):
count = 1
candies = [1]
for index in range(1, len(ratings)):
if ratings[index] > ratings[index - 1]:
count += 1
else:
count = 1
candies.append(count)
return candies
ll = candy(kids)
kids.reverse()
lr = candy(kids)
print(sum(map(max, zip(ll, reversed(lr)))))
```

## View More Similar Problems

## Castle on the Grid

You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given a grid, a start and a goal, determine the minmum number of moves to get to the goal. Function Description Complete the minimumMoves function in the editor. minimumMoves has the following parameter(s):

View Solution →## Down to Zero II

You are given Q queries. Each query consists of a single number N. You can perform any of the 2 operations N on in each move: 1: If we take 2 integers a and b where , N = a * b , then we can change N = max( a, b ) 2: Decrease the value of N by 1. Determine the minimum number of moves required to reduce the value of N to 0. Input Format The first line contains the integer Q.

View Solution →## Truck Tour

Suppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N-1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump. Initially, you have a tank of infinite capacity carrying no petr

View Solution →## Queries with Fixed Length

Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon

View Solution →## QHEAP1

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element

View Solution →## Jesse and Cookies

Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t

View Solution →