【算法练习】CSP--202109-2--非零段划分

70分思路

#include<iostream>
#include<vector>
#include <algorithm> // std::unique

using namespace std;

int n, a_max = -1, a_min = 9999, array_max = -1;

int sumArray(vector<int>x)
{
	int s = 0;
	for (auto& it : x)
	{
		if (it == 1)s++;
	}
	return s;
}

int main() {
	cin >> n;
	vector<int>a(n + 2, 0);
	for (size_t i = 1; i < n + 1; i++)
	{
		cin >> a[i];
		a_max = max(a_max, a[i]);
		a_min = min(a_min, a[i]);
	}

	for (size_t i = a_min; i <= a_max; i++)
	{
		vector<int>b = a;
		for (auto& it : b)
		{
			if (it < i || it == 0)it = 0;
			else it = 1;
		}

		// 去重
		auto jt = unique(b.begin(), b.end());
		b.erase(jt, b.end());

		array_max = max(array_max, sumArray(b));
	}

	cout << array_max;

	return 0;
}