forked from sanghaisubham/Algorithmic-Coding
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHistogram.cpp
More file actions
80 lines (64 loc) · 1.77 KB
/
Histogram.cpp
File metadata and controls
80 lines (64 loc) · 1.77 KB
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
73
74
75
76
77
78
79
80
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
while(n!=0)
{
long long height[n];
stack<long long>st;
long long ans=0,m=0,t,i;
for( i=0;i<n;i++)
{
cin>>height[i];
}
for( i=0;i<n;i++)
{
if(st.empty())
st.push(i);
else if(height[i]>=height[st.top()])
st.push(i);
else
{
while(!st.empty() && height[st.top()]>height[i])
{
t=height[st.top()];
st.pop();
if(!st.empty())
{
m=t*(i-st.top()-1);
// cout<<t<<" i "<<i<<" "<<st.top()<<" "<<m<<endl;
}
else
{
m=t*i;
//cout<<t<<" i "<<i<<" "<<m<<endl;
}
// if(!st.empty())
//cout<<m<<" "<<height[st.top()]<<" "<<i<<endl;;
ans=max(m,ans);
}
st.push(i);
}
}
while(!st.empty())
{
t=height[st.top()];
st.pop();
if(!st.empty())
{
m=t*(i-st.top()-1);
// cout<<t<<" i "<<i<<" "<<st.top()<<" "<<m<<endl;
}
else
{
m=t*i;
//cout<<t<<" i "<<i<<" "<<m<<endl;
}
ans=max(m,ans);
}
cout<<ans<<"\n";
cin>>n;
}
}