Question

An investor opens a new account and wants to invest in a number of assets. Each asset begins with a balance of O, and its value is stored in an array using 1-based indexing. Periodically, a contribution is received and equal investments are made in a subset of the portfolio. Each contribution will be given by investment amount, start index, end index. Each investment in that range will receive the contribution amount. Determine the maximum amount invested in any one investment after all contributions. For example, start with an array of 5 elements: investments = [0, 0, 0, 0, 0)* The variables left and right represent the starting and ending indices, inclusive. Another variable, contribution, is the new funds to invest per asset. The first investment is at index 1. left right contri inve bution [ 0, 0, 1 2 10 [ 10, 10, 2 4 5 [ 10, 15, 3 5 12 [ 10, 15,

Language: java

Answer 1

Required Function's Code Screenshots:

long maxValue (int n, **rounds) int rounds_rows, int rounds_columns, int // Define the variable to store // the maximum amount invested. long max = 0; // Define an array of size n, // to store the n investments. long *investments = (long*) malloc(sizeof(long) *n); int i=0; // Initially set all // the investments to 0. for (i=0;i<n;i++) { investments[i] = 0; } i=0; // Run the loop to // perform the rounds. while (i<rounds rows) { // Get the left value // of the current round. int left = rounds [i][0]; // Get the right value // of the current round. int right rounds [i][1]; = // Get the contribution // for the current round. int contribution = rounds [i] [2]; // Since the user uses 1-based // indexing, subtract 1 from left // and right as the program uses // O-based indexing. That is, the // investments in the array start // from 0 and not 1. right right 1; int j=0;

// Run the loop to add the // contribution to all the investments // between left and right, both inclusive. for(j=left; j<=right; j++) { investments[j] += contribution; } i++; } // Traverse the investments array // to find the maximum element. max = investments[0]; for(i=1; i<n;i++) { if(investments[i]>max) { max investments[i]; } } // Return the // maximum investment. return max; }

Required Function’s Code:

long maxValue(int n, int rounds_rows, int rounds_columns, int **rounds)

{

    // Define the variable to store

    // the maximum amount invested.

    long max = 0;

    

    // Define an array of size n,

    // to store the n investments.

    long *investments = (long*)malloc(sizeof(long)*n);

    int i=0;

    

    // Initially set all

    // the investments to 0.

    for(i=0;i<n;i++)

    {

        investments[i] = 0;

    }

    i=0;

    // Run the loop to

    // perform the rounds.

    while(i<rounds_rows)

    {

        // Get the left value

        // of the current round.

        int left = rounds[i][0];

        

        // Get the right value

        // of the current round.

        int right = rounds[i][1];

        // Get the contribution

        // for the current round.

        int contribution = rounds[i][2];

        // Since the user uses 1-based

        // indexing, subtract 1 from left

        // and right as the program uses

        // 0-based indexing. That is, the

        // investments in the array start

        // from 0 and not 1.

        right = right - 1;

        int j=0;

        // Run the loop to add the

        // contribution to all the investments

        // between left and right, both inclusive.

        for(j=left; j<=right; j++)

        {

            investments[j] += contribution;

        }

        i++;

    }

    // Traverse the investments array

    // to find the maximum element.

    max = investments[0];

    for(i=1; i<n;i++)

    {

        if(investments[i]>max)

        {

            max = investments[i];

        }

    }

    // Return the

    // maximum investment.

    return max;

}

Below is the code to show the working of the function.

Code Screenshots:

#include <assert.h> #include <stdio.h> #include <stdlib.h> int rounds rows, int rounds_columns, int long maxValue (int n, **rounds) { // Define the variable to store // the maximum amount invested. long max = 0; // Define an array of size n, // to store the n investments. long *investments = (long*) malloc(sizeof(long) *n); int i=0; // Initially set all 1 the investments to 0. for(i=0;i<n;i++) { investments[i] = 0; } i=0; // Run the loop to // perform the rounds. while (i<rounds_rows) { // Get the left value // of the current round. int left = rounds [i][0]; // Get the right value // of the current round. int right rounds [i][1]; // Get the contribution // for the current round. int contribution = rounds [i] [2]; // Since the user uses 1-based // indexing, subtract 1 from left // and right as the program uses // O-based indexing. That is, the // investments in the array start // from 0 and not 1.

right = right 1; int j=0; // Run the loop to add the // contribution to all the investments // between left and right, both inclusive. for(j=left; j<=right; j++) { investments[j] += contribution; } i++; } // Traverse the investments array // to find the maximum element. max investments [0]; for(i=1; i<n;i++) = { if(investments[i]>max) { max = investments[i]; } } // Return the // maximum investment. return max; } int main(void) { // Declare the // required variables. int n; int rounds rows; int rounds_columns; // Read the user input. scanf("%d",&n); scanf("%d", &rounds_rows); scanf("%d", &rounds_columns); // Define the array to store // the details of the rounds. int **rounds; rounds (int**) (malloc(sizeof(int*) *rounds_rows)); int i=0; =

for (i=0;i<rounds_rows;i++) { rounds [i] (int*) (malloc(sizeof (int) *rounds_columns)); int j=0; // Read the details // of each round. for(j=0; j<rounds_columns; j++) { scanf("%d", &rounds [i][j]); } } // Call the function and get // the maximum investment. long max = maxValue (n, rounds_rows, rounds_columns, rounds); // Display the // maximum investment. printf ("The maximum amount" invested is: %10\n", max); IT // Return from the // main() function. return 0; }

Sample Output:

5 3 3 1 2 10 2 4 5 3 5 12 The maximum amount invested is: 17

Code to Copy:

#include <assert.h>

#include <stdio.h>

#include <stdlib.h>

long maxValue(int n, int rounds_rows, int rounds_columns, int **rounds)

{

    // Define the variable to store

    // the maximum amount invested.

    long max = 0;

    

    // Define an array of size n,

    // to store the n investments.

    long *investments = (long*)malloc(sizeof(long)*n);

    int i=0;

    

    // Initially set all

    // the investments to 0.

    for(i=0;i<n;i++)

    {

        investments[i] = 0;

    }

    i=0;

    // Run the loop to

    // perform the rounds.

    while(i<rounds_rows)

    {

        // Get the left value

        // of the current round.

        int left = rounds[i][0];

        

        // Get the right value

        // of the current round.

        int right = rounds[i][1];

        // Get the contribution

        // for the current round.

        int contribution = rounds[i][2];

        // Since the user uses 1-based

        // indexing, subtract 1 from left

        // and right as the program uses

        // 0-based indexing. That is, the

        // investments in the array start

        // from 0 and not 1.

        right = right - 1;

        int j=0;

        // Run the loop to add the

        // contribution to all the investments

        // between left and right, both inclusive.

        for(j=left; j<=right; j++)

        {

            investments[j] += contribution;

        }

        i++;

    }

    // Traverse the investments array

    // to find the maximum element.

    max = investments[0];

    for(i=1; i<n;i++)

    {

        if(investments[i]>max)

        {

            max = investments[i];

        }

    }

    // Return the

    // maximum investment.

    return max;

}

int main(void) {

    

    // Declare the

    // required variables.

    int n;

    int rounds_rows;

    int rounds_columns;

    // Read the user input.

    scanf("%d",&n);

    scanf("%d", &rounds_rows);

    scanf("%d", &rounds_columns);

    // Define the array to store

    // the details of the rounds.

    int **rounds;

    rounds = (int**)(malloc(sizeof(int*)*rounds_rows));

    int i=0;

    for(i=0;i<rounds_rows;i++)

    {

        rounds[i] = (int*)(malloc(sizeof(int)*rounds_columns));

        int j=0;

        

        // Read the details

        // of each round.

        for(j=0;j<rounds_columns;j++)

        {

            scanf("%d", &rounds[i][j]);

        }

    }

    // Call the function and get

    // the maximum investment.

    long max = maxValue

    (n, rounds_rows,

    rounds_columns,rounds);

    

    // Display the

    // maximum investment.

    printf("The maximum amount"

    " invested is: %ld\n", max);

    

    // Return from the

    // main() function.

    return 0;

}