普通的USACO

#include<bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    vector<int> h(n);
    for (int i = 0; i < n; ++i) {
        cin >> h[i];
    }
    vector<int> left(n, 1);
    for (int i = 1; i < n; ++i) {
        if (h[i] >= h[i - 1]) {
            left[i] = left[i - 1] + 1;
        }
    }
    vector<int> right(n, 1);
    for (int i = n - 2; i >= 0; --i) {
        if (h[i] >= h[i + 1]) {
            right[i] = right[i + 1] + 1;
        }
    }
    int mw = 0;
    for (int i = 0; i < n; ++i) {
        mw = max(mw, left[i] + right[i] - 1);
    }
    cout << mw << endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,cnt=1;
	cin>>n;
	int a[n];
	int b[n];
	int c[n];
	for(int i=0;i<n;i++){
		cin>>a[i];
		c[i]=a[i];
	}
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			if(a[j-1]==a[j]||a[j-1]>a[j]){
				cnt++;
			}
			else{
				break;
			}
		}
		for(int k=i-1;k>=0;k--){
			if(a[k+1]==a[k]||a[k+1]>a[k]){
				cnt++;
			}
			else{
				break;
			}
		}
		b[i]=cnt;
		cnt=1;
	}
	sort(b,b+n);
	cout<<b[n-1]<<endl;
	return 0;
}