#include<bits/stdc++.h>
using namespace std;
#define int long long
using un = unsigned;
#define dbg(X) cout << __LINE__ <<' ' << X << endl;
void solve()
{
int n;
cin >> n;
vector<int> a(n);
int maxwar = 0,maxin;
for(int i = 0;i<n;i++)
{
cin >> a[i];
if(a[i]>maxwar)
{
maxwar = a[i];
maxin = i;
}
}
stack<int> stos;
int i = maxin;
int num = 0;
maxwar = 0;
while(num<n)
{
if(i<0)
i = n-1;
while(!stos.empty() && stos.top()<=a[i])
{
stos.pop();
}
stos.push(a[i]);
maxwar = max(maxwar,(int)stos.size());
num++;
i--;
}
cout << maxwar;
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
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 | #include<bits/stdc++.h> using namespace std; #define int long long using un = unsigned; #define dbg(X) cout << __LINE__ <<' ' << X << endl; void solve() { int n; cin >> n; vector<int> a(n); int maxwar = 0,maxin; for(int i = 0;i<n;i++) { cin >> a[i]; if(a[i]>maxwar) { maxwar = a[i]; maxin = i; } } stack<int> stos; int i = maxin; int num = 0; maxwar = 0; while(num<n) { if(i<0) i = n-1; while(!stos.empty() && stos.top()<=a[i]) { stos.pop(); } stos.push(a[i]); maxwar = max(maxwar,(int)stos.size()); num++; i--; } cout << maxwar; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; } |
English