-
Notifications
You must be signed in to change notification settings - Fork 0
/
findingSpans_stacks.cpp
72 lines (72 loc) · 1.08 KB
/
findingSpans_stacks.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
72
#include <iostream>
#define endl '\n'
using namespace std;
struct stack
{
int top;
int capacity;
int* array;
};
stack* createStack()
{
stack* s=new stack;
if(!s)
return NULL;
s->top=-1;
s->capacity=20;
s->array=new int[s->capacity];
if(!s->array)
return NULL;
return s;
}
void push(stack* s,int data)
{
if(s->top==s->capacity-1)
{
cout<<"Stack overflow"<<endl;
return;
}
s->array[++(s->top)]=data;
}
void pop(stack* s)
{
(s->top)--;
}
bool isEmptyStack(stack* s)
{
return s->top==-1;
}
void findSpans(int* arr,int* span,int n)
{
stack* s=createStack();
int i,p;
for(i=0;i<n;i++)
{
while(!isEmptyStack(s) && arr[i] > arr[s->array[s->top]])
pop(s);
if(isEmptyStack(s))
p=-1;
else
p=s->array[s->top];
span[i]=i-p;
push(s,i);
}
delete s;
//delete []s->array;
}
int main()
{
int i,n;
cin>>n;
int* arr=new int[n];
int* span=new int[n];
for(i=0;i<n;i++)
cin>>arr[i];
findSpans(arr,span,n);
for(i=0;i<n;i++)
cout<<span[i]<<" ";
cout<<endl;
delete []arr;
delete []span;
return 0;
}