연속 부분 증가수열

1.cpp

#include <bits/stdc++.h>

using namespace std;

int n;
vector<int> a;

int main(void) {

	cin >> n;

	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;

		a.push_back(x);
	}

	int cnt = 1, max = -2147000000;

	for (int i = 0; i < n - 1; i++) {
		if (a[i] <= a[i + 1]) cnt++;
		else cnt = 1;

		if (cnt > max) max = cnt;
	}

	cout << max;

	return 0;
}