使用C++的CCF-CSP满分解决方案 202109-2 非零段划分

满分代码实现

#include <map>
#include <set> 
#include <queue>
#include <iostream>
#include <algorithm>
using namespace std;

class Solution {
private:
	static const int N = 500001;
	int b[N];
public:
    void solve() {
    	int n = 0;
		cin >> n;
		vector<int> v(n + 2);
		for (int i = 1; i <= n; i++) {
			cin >> v[i];
		}
		n = unique(v.begin(), v.end()) - v.begin();
		for (int i = 1; i < n - 1; i++) {
			if (v[i] > v[i - 1] && v[i] > v[i + 1]) b[v[i]]++;
			if (v[i] < v[i - 1] && v[i] < v[i + 1]) b[v[i]]--;
		}
		int t = 0, ans = 0;
		int ma = *max_element(v.begin(), v.end());
		for (int i = ma; i >= 0; i--) {
			t += b[i];
			// cout << i << " " << t << endl;
			ans = max(t, ans);
		}
		cout << ans;
    }
};

int main() {
	// 提高cin,cout的速度
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	Solution solution;
	solution.solve();
	return 0;
}