func_code_string: #include <bits/stdc++.h>   #pragma GCC optimize( Ofast )   #pragma GCC optimize( unroll-loops )   using namespace std;   void test_case() {     int n;     cin >> n;     vector<int> arr(n);     for (int i = 0; i < n; i++) cin >> arr[i];     vector<int> l(n), r(n);     l[0] = 1;     for (int i = 1; i < n; i++) {       if (arr[i] > arr[i - 1])         l[i] = l[i - 1] + 1;       else         l[i] = 1;     }     r[n - 1] = 1;     for (int i = n - 2; i >= 0; i--) {       if (arr[i] < arr[i + 1])         r[i] = r[i + 1] + 1;       else         r[i] = 1;     }     int ans = 1;     for (int i = 0; i < n; i++) {       if (i > 0 && i < n - 1 && arr[i + 1] >= arr[i - 1] + 2) {         ans = max(ans, l[i - 1] + r[i + 1] + 1);       }       if (i > 0 && arr[i] <= arr[i - 1]) {         ans = max(ans, 1 + l[i - 1]);       }       if (i < n - 1 && arr[i] >= arr[i + 1]) {         ans = max(ans, 1 + r[i + 1]);       }     }     ans = max(ans, l[n - 1]);     ans = max(ans, r[0]);     cout << ans << endl;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(nullptr);     int t = 1;     while (t--) test_case();     return 0;   }   