Question

Given an array of integers representing heights of consecutive steps, we say that a tumble is a sequence of strictly decreasing numbers and the height of the tumble is the difference between the height of the top step and the bottom step. For example, if there are consecutive steps with heights 16, 9, 4 then they form a tumble of height 12 (= 16-4). With consecutive steps of heights, 0, 4, 12, 4, 5, 7, 2, 1 there is a tumble 12, 4 (with height 8) and another tumble 7, 2, 1 (with height 6). Note that we do not say 0, 4, 12 is a tumble because tumbles must be decreasing. Output the maximum height of a tumble. If there is no tumble (i.e. there are never consec- utive steps that decrease in height) then output 0 Input The first line contains a single integer 1 <n < 100, 000 denoting the number of steps. The second line contains n space-separated integers, each between 0 and 109, denoting the heights of the steps Output Output a single line containing an integer indicating the maximum height of a tumble in the input sequence. Sample Input 1 4 1 762 Sample Output 1 Explanation: The tumble 7, 6, 2 has height 5 (= 7-2) Sample Input 2 4 3 66 8 Sample Output 2

Answer 1

Hi,

Please find the program and code below.

If your requirement is in another programming language ., this code can be migrate to c and c++ easily.

package staticclasses;

import java.util.Scanner;

public class Tumble {

public static void main(String[] args) {

int size;

Scanner sc = new Scanner(System.in);

System.out.println("Enter the size of steps");

size = sc.nextInt();

int tumble[]=new int[size];

System.out.println("Enter height of the steps");

for(int i=0;i<size;i++){

tumble[i] = sc.nextInt();

}

sc.close();

int minPoint=0,lastElement=0; //min point shows the tumble value at left side

int maxPoint=-1; //max point shows the tumble value at right side tubme 9 6 1, min =9 max=1

int tumbHeight=0; //it will store tumble height

minPoint = tumble[0]; //initialize min point from 0 position

for(int i=1;i<size;i++){  

lastElement=tumble[i-1]; //keep track of last element to see if new element is in increasing order or decreasing order

if(tumble[i]<lastElement){ //if new element is in increasing order

maxPoint = tumble[i]; //assign that to max point

}else{ //else

if(maxPoint!=-1){ //if maxpoint is not -1.

if(tumbHeight <( minPoint - maxPoint) ){ //calculate new tumble height.

tumbHeight = minPoint - maxPoint; //if new height is greater than old one set it

}

}

minPoint = tumble[i]; //min point is corrent element

maxPoint =-1; //max point is -1

}

}

if(maxPoint!=-1){ //this step is to check height for last element

if(tumbHeight <( minPoint - maxPoint) ){

tumbHeight = minPoint - maxPoint;

}

}

System.out.println("Tumble has height "+tumbHeight);

}

}

Quick Access ||| !哈Java EE Console X | <terminated> Tumble Java Application] CP Enter the size of steps Enter height of the steps 0 4 12 457 21 Tumble has height 8 ws the tumble value ws the tumble value ight from 0 position last element to see nt is in increasing

Quick Access Java EEJava<C/c+ -O Console X Console terminated Tumble [Java Application] C Program FilesJa Enter the size of steps Enter height of the steps 1 762 le value le value umble has height 5 ition t to see