-
Notifications
You must be signed in to change notification settings - Fork 0
/
stock_span_problem.cpp
71 lines (62 loc) · 1.29 KB
/
stock_span_problem.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
// { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
//Function to calculate the span of stock’s price for all n days.
vector <int> calculateSpan(int price[], int n)
{
vector<int>v;
stack<pair<int,int>>s;
for(int i=0;i<n;i++){
if(s.size() == 0){
v.push_back(-1);
}
else if(s.size() >0 && s.top().first > price[i]){
v.push_back(s.top().second);
}
else if(s.size() > 0 && s.top().first <= price[i]){
while(s.size() > 0 && s.top().first <= price[i]){
s.pop();
}
if(s.size() == 0){
v.push_back(-1);
}
else
v.push_back(s.top().second);
}
s.push({price[i],i});
}
for(int i=0;i<v.size();i++){
v[i] = i - v[i];
}
return v;
}
};
// { Driver Code Starts.
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int i,a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
Solution obj;
vector <int> s = obj.calculateSpan(a, n);
for(i=0;i<n;i++)
{
cout<<s[i]<<" ";
}
cout<<endl;
}
return 0;
}
// } Driver Code Ends