-
Notifications
You must be signed in to change notification settings - Fork 1
/
stock_span.cpp
55 lines (49 loc) · 918 Bytes
/
stock_span.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
#include<bits/stdc++.h>
using namespace std;
class Solution
{
public:
vector <int> calculateSpan(int price[], int n)
{
stack<pair<int,int>> s;
s.push({0,price[0]});
int i = 1;
vector<int> ans;
ans.push_back(1);
while(i<n){
while(!s.empty() && s.top().second<=price[i]){
s.pop();
}
if(!s.empty())
ans.push_back(i-s.top().first);
else
ans.push_back(i+1);
s.push({i,price[i]});
i++;
}
return ans;
}
};
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;
}