Chief Hopper

Problem Statement :

Chief's bot is playing an old DOS based game. There is a row of buildings of different heights arranged at each index along a number line. The bot starts at building  and at a height of . You must determine the minimum energy his bot needs at the start so that he can jump to the top of each building without his energy going below zero.

Units of height relate directly to units of energy. The bot's energy level is calculated as follows:

If the bot's  is less than the height of the building, his 
If the bot's  is greater than the height of the building, his

Function Description

Complete the chiefHopper function in the editor below.

chiefHopper has the following parameter(s):

int arr[n]: building heights

int: the minimum starting 

Input Format

The first line contains an integer , the number of buildings.

The next line contains  space-separated integers , the heights of the buildings.

Solution :


                            Solution in C :

In  C :

#include <stdio.h>
#include <stdlib.h>

int main() {
  int n, *h, i;
  unsigned long long tot;
  h = malloc(n * sizeof(int));
  for (i=0; i<n; i++) scanf("%d",&h[i]);
  tot = 0;
  while (i>=0) {
    tot += h[i];
    if (tot & 1) tot++;
    tot /= 2;
  return 0;

                        Solution in C++ :

In  C++  :

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <limits>
#include <cstring>
#include <string>
using namespace std;

#define pairii pair<int, int>
#define llong long long
#define pb push_back
#define sortall(x) sort((x).begin(), (x).end())
#define INFI  numeric_limits<int>::max()
#define INFLL numeric_limits<llong>::max()
#define INFD  numeric_limits<double>::max()
#define FOR(i,s,n) for (int (i) = (s); (i) < (n); (i)++)
#define FORZ(i,n) FOR((i),0,(n))

const int MAXN = 100005;
int ar[MAXN];

void solve() {
  int n;
  FORZ(i,n) scanf("%d",ar+i);
  int res = 0;
  for (int i = n-1; i >= 0; i--) {
    int x = res + ar[i];
    res = x/2 + x%2;

int main() {
#ifdef DEBUG
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
  return 0;

                        Solution in Java :

In  Java :

import java.util.Scanner;

public class Solution {

    public static void main(String[] args) {
		Scanner in = new Scanner(;
		int n = in.nextInt();
		String s = in.nextLine();
		int[] heights = new int[n];
		for(int i = 0; i < n; i++) {
			heights[i] = in.nextInt();

	public static long calcMinEnergy(int[] heights) {
		if(heights.length < 1) return 0;
		long energy = 0;
		for(int i = 0; i < heights.length; i++) {
			long tmp = energy + heights[heights.length - 1 - i];
			int one = (int)(tmp % 2);
			energy = tmp / 2 + one;
		return energy;

                        Solution in Python : 
In  Python3 :

N = int(input())
heights = [int(n) for n in input().split()]

max_h = max(heights)

interval = [1, max_h]

def get_final_energy(e, heights):
	for h in heights:
		e = 2 * e - h
	return e

while interval[0] < interval[1] - 1:
	mid = (interval[0] + interval[1]) // 2
	fe = get_final_energy(mid, heights)
	if fe >= 0:
		interval[1] = mid
		interval[0] = mid

if get_final_energy(interval[0], heights) >= 0:

View More Similar Problems

Find the Running Median

The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.

View Solution →

Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →

Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →

Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →

Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →

Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →