#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int solution(vector<int>& blocks) {
int n = blocks.size();
vector<int> left(n), right(n);
left[0] = 0;
for (int i = 1; i < n; i++) {
if (blocks[i - 1] >= blocks[i])
left[i] = left[i - 1];
else
left[i] = i;
}
right[n - 1] = n - 1;
for (int i = n - 2; i >= 0; i--) {
if (blocks[i + 1] >= blocks[i])
right[i] = right[i + 1];
else
right[i] = i;
}
int ans = 1;
for (int i = 0; i < n; i++) {
ans = max(ans, right[i] - left[i] + 1);
}
return ans;
}
};
int main() {
Solution sol;
vector<int> blocks1 = {2, 6, 8, 5};
cout << "Output: " << sol.solution(blocks1) << endl;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNsYXNzIFNvbHV0aW9uIHsKcHVibGljOgogICAgaW50IHNvbHV0aW9uKHZlY3RvcjxpbnQ+JiBibG9ja3MpIHsKICAgICAgICBpbnQgbiA9IGJsb2Nrcy5zaXplKCk7CiAgICAgICAgdmVjdG9yPGludD4gbGVmdChuKSwgcmlnaHQobik7CgogICAgICAgICBsZWZ0WzBdID0gMDsKICAgICAgICBmb3IgKGludCBpID0gMTsgaSA8IG47IGkrKykgewogICAgICAgICAgICBpZiAoYmxvY2tzW2kgLSAxXSA+PSBibG9ja3NbaV0pCiAgICAgICAgICAgICAgICBsZWZ0W2ldID0gbGVmdFtpIC0gMV07CiAgICAgICAgICAgIGVsc2UKICAgICAgICAgICAgICAgIGxlZnRbaV0gPSBpOwogICAgICAgIH0KCiAgICAgICAgIHJpZ2h0W24gLSAxXSA9IG4gLSAxOwogICAgICAgIGZvciAoaW50IGkgPSBuIC0gMjsgaSA+PSAwOyBpLS0pIHsKICAgICAgICAgICAgaWYgKGJsb2Nrc1tpICsgMV0gPj0gYmxvY2tzW2ldKQogICAgICAgICAgICAgICAgcmlnaHRbaV0gPSByaWdodFtpICsgMV07CiAgICAgICAgICAgIGVsc2UKICAgICAgICAgICAgICAgIHJpZ2h0W2ldID0gaTsKICAgICAgICB9CgogICAgICAgIGludCBhbnMgPSAxOwogICAgICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgICAgIGFucyA9IG1heChhbnMsIHJpZ2h0W2ldIC0gbGVmdFtpXSArIDEpOwogICAgICAgIH0KCiAgICAgICAgcmV0dXJuIGFuczsKICAgIH0KfTsKaW50IG1haW4oKSB7CiAgICBTb2x1dGlvbiBzb2w7CgogICAgIHZlY3RvcjxpbnQ+IGJsb2NrczEgPSB7MiwgNiwgOCwgNX07CiAgICBjb3V0IDw8ICJPdXRwdXQ6ICIgPDwgc29sLnNvbHV0aW9uKGJsb2NrczEpIDw8IGVuZGw7ICAKfQo=