#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios::sync_with_stdio(0);
cin.tie(nullptr);
int n;
cin>>n;
deque <int> dq;
for(int i = 0; i < n; i++){
int tmp;
cin>>tmp;
dq.push_back(tmp);
}
int MAX = 0;
for(int i = 0; i < n; i++){
int count = 0, max_bef = 0;
for(auto& j : dq)
if(j > max_bef){
max_bef = j;
count++;
}
MAX = max(count, MAX);
dq.push_front(dq.back());
dq.pop_back();
}
cout<<MAX;
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 | #include <bits/stdc++.h> using namespace std; #define int long long signed main(){ ios::sync_with_stdio(0); cin.tie(nullptr); int n; cin>>n; deque <int> dq; for(int i = 0; i < n; i++){ int tmp; cin>>tmp; dq.push_back(tmp); } int MAX = 0; for(int i = 0; i < n; i++){ int count = 0, max_bef = 0; for(auto& j : dq) if(j > max_bef){ max_bef = j; count++; } MAX = max(count, MAX); dq.push_front(dq.back()); dq.pop_back(); } cout<<MAX; return 0; } |
English