Naxocist

Rocket

Apr 4th, 2022 (edited)
120
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.50 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #define endll '\n'
  3. using namespace std;
  4.  
  5. const int N = 1e5 + 3;
  6. int a[N];
  7.  
  8. int main()
  9. {
  10.     int n; scanf("%d", &n);
  11.     for(int i=0; i<n; ++i) scanf("%d", &a[i]);
  12.  
  13.     int mxh = 0, ans = -1e7;
  14.     for(int i=n-1; i>=0; --i){
  15.         if(a[i] <= mxh) continue;
  16.         mxh = a[i];
  17.         int j=i;
  18.         while(a[j] <= a[i] && j >= 0) --j;
  19.  
  20.         int k = i-j;
  21.         if(j == 0) k++;
  22.         ans = max(ans, k);
  23.     }
  24.  
  25.     printf("%d", ans);
  26.     return 0;
  27. }
  28.  
Add Comment
Please, Sign In to add comment