Anwar_Rizk

Untitled

Jul 31st, 2021 (edited)
76
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.87 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define cin(vec) for(auto& i : vec) cin >> i
  4. #define cin_2d(vec, n, m) for(int i=0; i<n; i++) for(int j=0; j<m && cin >> vec[i][j]; j++);
  5. #define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
  6. #define cout_2d(vec, r, c) for(int i=0; i<r; i++, cout << "\n") for(int j=0; j<c && cout << vec[i][j]; j++);
  7. #define matrix(grid, n, m) vector < vector <int> > grid(n, vector <int> (m));
  8. #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
  9. #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  10. #define fixed(n) cout << fixed << setprecision(n)
  11. #define Num_of_Digits(n) ((int)log10(n)+1)
  12. #define getline(s) getline(cin >> ws, s)
  13. #define TC int t; cin >> t; while(t--)
  14. #define rall(s) s.rbegin(), s.rend()
  15. #define all(s) s.begin(), s.end()
  16. #define sz(x) int(x.size())
  17. #define Pair pair <ll, ll>
  18. #define fi first
  19. #define se second
  20. #define pb(x) push_back(x)
  21. #define ll long long
  22. #define PI acos(-1)
  23. #define Mod 1'000'000'007
  24. #define INF 2'000'000'000
  25. #define EPS 1e-9
  26.  
  27. void Code_Crush(){
  28.   ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  29.   #ifndef ONLINE_JUDGE    // Anwar Rizk 🥇🖤
  30.     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  31.   #endif
  32.   Time
  33. }
  34.  
  35. int main()
  36. {   Code_Crush();
  37.  
  38.     int n;                                       cin >> n;
  39.     vector <int> height(n);                      cin(height);
  40.     int Max = 0;
  41.     for(int i = 0; i < n; i++){
  42.       int tmp = height[i], m = 1;
  43.       for(int j = i + 1; j < n; j++){
  44.         if(height[j] <= tmp)  m++, tmp = height[j];  
  45.         else                  break;
  46.       }
  47.       for(int j = i - 1; j >= 0; j--){
  48.         if(height[j] <= tmp)  m++, tmp = height[j];
  49.         else                  break;
  50.       }
  51.       Max = max(Max, m);
  52.     }
  53.     cout << Max;
  54.  
  55.   return 0;
  56. }
Add Comment
Please, Sign In to add comment