The stock span problem is a financial problem where we have a series of n daily price quotes for a stock and we need to calculate the span of stock’s price for all n days. The span Si of the stock’s price on a given day i is defined as the maximum number of consecutive days just before the given day, for which the price of the stock on the current day is less than or equal to its price on the given day. Now, you need to find out the span values for the given number of days and their daily prices. For example, if an array of 7 day's prices is given as {100, 80, 60, 70, 60, 75, 85}, then the span values for corresponding 7 days are {1, 1, 1, 2, 1, 4, 6} . FUNCTIONAL REQUIREMENTS: void stockSpan(int,int*); Input Format: Input consists of n+1 integers. The first integer corresponds to n, the number of days. The next n integers correspond to stock prices on days 1, 2...n. Output Format: The output consists of n integers that correspond to the span values.
Answers
Answer:
Explanation:
#include <iostream>
using namespace std;
int stockspan(int n, int arr[])
{
for (int i = 0; i < n; i++)
cout<< arr[i]<<"\n";
}
int main()
{
int z;
std::cin>>z;
int a[z];
for(int i=0;i<z;i++)
{
std::cin>>a[i];
}
int n = sizeof(a)/sizeof(a[0]);
int S[n];
S[0] = 1;
for (int i = 1; i < n; i++)
{
S[i] = 1;
for (int j = i-1; (j>=0)&&(a[i]>=a[j]); j--)
S[i]++;
}
stockspan(n,S);
}
Stock Span
Explanation:
The stock span problem is a financial problem where we have a series of n daily price quotes for a stock and we need to calculate the span of stock’s price for all n days. The span Si of the stock’s price on a given day i is defined as the maximum number of consecutive days just before the given day, for which the price of the stock on the current day is less than or equal to its price on the given day.
For example, if an array of 7 days prices is given as {100, 80, 60, 70, 60, 75, 85}, then the span values for corresponding 7 days are {1, 1, 1, 2, 1, 4, 6}.
