O(n) solution giving TLE

#1

why is this O(n) solution giving TLE for the question Maximum length bitonic subarray.

here is my code.

#2

here is my code. #include using namespace std; int main() { int t, n; cin >> t; while (t–) { cin >> n; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int inc[n]; int dec[n]; int i, max; inc[0] = 1; dec[n - 1] = 1; for (i = 1; i < n; i++) { if (arr[i] >= arr[i - 1]) inc[i] = inc[i - 1] + 1; else { inc[i] = 1; } } for (i = n - 2; i >= 0; i–) { if (arr[i] >= arr[i + 1]) dec[i] = dec[i + 1] + 1; else { dec[i] = 1; } } max = inc[0] + dec[0] - 1; for (i = 1; i < n; i++) { if (inc[i] + dec[i] - 1 > max) max = inc[i] + dec[i] - 1; } cout << max << endl; } return 0; }

#3

you are getting TLE because of large input size, please add

ios_base::sync_with_stdio(false);
cin.tie(NULL);

in the beginning of your code
Corrected code