write the code Given two integer arrays A and B of size N.There are N gas stations along a circular route, where the amount of gas atstation i is A[i].You have a car with an unlimited gas tank and it costs B[i] of gas to travel fromstation ito its next station (i+1). You begin the journey with an empty tank at one of thegas stations.Return the minimum starting gas station's index if you can travel around thecircuit once, otherwise return -1.You can only travel in one direction. i to i+1, i+2, ... n-1, 0, 1, 2. Completing thecircuit means starting at i andending up at i again.

Answered: write the code

Engineering

Computer Science

write the code

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Problem Alice was given a number line containing every positive integer, x, where 1<=x<=n. She was also given m line segments, each having a left endpoint, l (1<=l<=n), a right endpoint, r (1<=r<=n), and an integer weight, w. Her task is to cover all numbers on the given number line using a subset of the line segments, such that the maximum weight among all the line segments in the chosen subset is minimal. In other words, let S=(l1,r1,w1),(l2,r2,w2),....,(lk,rk,wk), represent a set of k line segments chosen by Alice, max(w1,w2,...,wk) should be minimized. All numbers 1,2,....n should be covered by at least one of k the chosen line segments. It is okay for the chosen line segments to overlap. You program should output the minimized maximum weight in the chosen subset that covers all the numbers on the number line, or -1 if it is not possible to cover the number line. Input format The first line of the input contains an integer, n - denoting the range of numbers…
Write a program that fills an integer array of size 1000 with random positive integers between 1 and 10.Assume that each element represents a different city and the integers stored in the array represent thenumber of golds in those cities. The program traverses over the array and collects the golds at each city,starting from a random position. When the program visits a certain city, all of the golds are collected,and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues withthe rule given below. If the position at the nth step is denoted by pn, and the number of golds at the citypn is denoted by gn,??+1 = {| ((??−1 + ?? + ??) ???1000|, ????? 2 = 0| ((??−1 + ?? − ??) ???1000|, ????? 2 = 1.The program continues visiting cities until the last three visited city has no gold.The program, at each visit, should print out the following information:• The current city index (pn).• The previous city index (pn-1).• The number of golds at the current city…
Consider an array A of N values (N entered by the user). Write a C program that creates a second array B such that the i-th element of B, i.e., B[i] is equal to A[0] *A[1] * A[2] * ... A[i]; In other words:- B[0] = A[0]- B[1] = A[0] * A[1];- B[2] = A[0] * A[1] * A[2];- B[3] = A[0] * A[1] * A[2] * A[3]- ....etc.For this exercise, we would like to implement two solutions and compare their complexity /performance in terms of computation time.Solution 1: Implement blindly the following algorithms: for each element B[i], compute A[0] *A[1] * A[2] * .... *A[i] and save the result in B[i];To test the solution, create an array A of 1000 elements and initialize each of its elements with arandom value (instead of asking the user to . To do that, use the function rand, which, every timecalled, returns a random number Questions:- How long does your program take to produce the solution?- Analyze the solution above and explain why it is taking long time. What are the mainfactors that affect how long…
Given an array of meeting time intervals consisting ofstart and end times [[s1,e1],[s2,e2],...] (si < ei),determine if a person could attend all meetings. For example,Given [[0, 30],[5, 10],[15, 20]],return false."""
Implement the buildDistributionArray function to take an array of scores, built by parseScores, as an argument. A grade distribution array of length 5 is returned. Loop through the scores array and tally up the number of A, B, C, D, and F scores using the standard scoring system (90 and above = A, 80‐89 = B, 70‐79 = C, etc.). Store these totals in a distribution array where the number of As is the first number, number of Bs is the second number, etc. Ex: ["45","78","98","83","86","99","59"] → [2, 2, 1, 0, 2] buildDistributionArray returns [0, 0, 0, 0, 0] when the scoresArray argument is empty.
FOR JAVA Write a Java method that takes two 2 dimensional int arrays (a and b) and a 2 dimensional boolean array (c) where all three arrays have the same size. Your method should return an array (result) such that, if a partic- ular element in c is true, then the corresponding (same indexed) element in result must be the multiplication of the the corresponding elements of a and b. If the element in c is false, then the the corresponding element in result must be the negative of multiplication of the the corresponding element in a and b. For example ifa = {{1,2,3},{4,5}},b = {{1,2,1},{0,2}} andc = {{true,false,true},{false,true}}, then the result should be result={{1, -4, 3}{0, 10}}.
There are n cities connected by some number of flights. You are given an array of flights F[1, . . . , n], where F[i] = (Fromi, Toi, pi) indicates that there is a flight from city Fromi to city Toi with cost pi. You are also given three integers src, dst, and k, return the cheapest price from city src to city dst with at most k stops. If there is no such route, return -1. Precisely define the subproblem.Provide the recurrence equation.Describe the algorithm in pseudocode to compute the optimal value.Describe the algorithm in pseudocode to print out an optimal solution.
We have a list that stores the repeated heart-rate measurements for the same patient over several tests. Each inner-list is a test and for that test, the heart rate is monitored for some time while taking a few measurements. Next, we would like to calculate the average of the measurements for each test.heart_rate = [ [ 72, 75, 71, 73], # resting[ 91, 90, 94, 93], # walking slowly[ 130, 135, 139, 142], # running on treadmill[ 120, 118, 110, 105, 100, 98]] # after minute recoveryIn your code, define a function calculate_average_heart_rates() that accepts the list heart_rate as its only input argument. Inside the function, use nested loops to calculate the average heart rate during each test scenario. This function should return a list that contains the average heart rate values of a patient for the four test scenarios.Write unit tests
Write a function that gets an array of ints of length n, and a number k, and returns the longest subsequence of consecutive k’s in the array. For example - On input ([1, 1, 3, 3, 3, 1, 5, 1], 1), the function returns 3 - On input ([1, 3, 3, 2, 3, 3, 3, 3], 3), the function returns 4 - On input ([3, 5, 2, 5, 2, 5, 5], 3), the function returns 2 - On input ([1, 2, 3, 3, 3, 3], 5), the function returns 0 // returns the length of the longest subsequence // of consecutive k’s in the array int longest_seq(const int* ar, int n, int k); test for the function: void test_q1() { inta1[] = {1, 1, 3, 3, 3, 1, 5, 1}; if (longest_seq(a1, 8, 1) == 2) printf("Q1-1 ok\n"); else printf("Q1-1 ERROR\n"); inta2[] = {1,3,3,2,3,3,3,3}; if (longest_seq(a2, 8, 3) == 4) printf("Q1-2 ok\n"); else printf("Q1-2 ERROR\n"); }
Given two arrays A and B of equal size N, the task is to find a vector containing only those elements which belong to exactly one array - either A or B - but not both. That is, if some element x appears in both A and B it should not be included in the output vector. Complete the implementation of "getVector(vector<ll>A, vector<ll>B, int N)" function. Example: Input: 1 3 5 7 1 3 2 4 6 7 8 Output: 3 5 1 3 2 4 6 8 The driver codes are attached in the images below. DO NOT CHANGE THE PROVIDED DRIVER CODES AT ALL, LEAVE THEM EXACTLY THE SAME. ONLY ADD CODE TO THE "getVector(vector<ll>A, vector<ll>B, int N)" FUNCTION
You are given a list of integers nums and a positive integer k. Your task is to implement a function find_subsequence(nums, k) that returns the length of the longest increasing subsequence of nums such that the difference between the maximum and minimum element in the subsequence is at most k. For example, given the list [1, 3, 2, 4] and k = 2, the longest increasing subsequence satisfying the condition has length 2 and is [1, 2]. You may assume that the list nums has at least one element and that k is at least 1. Constraints: The list nums has at most length $10^6$. Examples: find_subsequence([1, 3, 2, 4], 2) => 2 find_subsequence([1, 2, 3, 4, 5], 1) => 5 find_subsequence([5, 4, 3, 2, 1], 3) => 1 find_subsequence([1, 2, 3, 2, 3, 4, 5, 4, 5, 6], 2) => 4
Write a program that reads two matrices of integers. It then generates the sum, difference and productof the two matrices.The sum of the two matrices of the same size is a matrix with elements that are the sums of thecorresponding elements of the two given matrices. Addition is not defined for matrices of different sizes.If A and B are matrices of the same size, then we define subtraction as follows: A – B = A + (-B). Thus, tosubtract matrix B from matrix A, we simply subtract corresponding elements.To multiply a matrix by another matrix we need to do the "dot product" of rows and columns. The "DotProduct" is where we multiply matching members, then sum up:(1, 2, 3) • (7, 9, 11) = 1×7 + 2×9 + 3×11 = 58We match the 1st members (1 and 7), multiply them, likewise for the 2nd members (2 and 9) and the3rd members (3 and 11), and finally sum them up.