Submission #1898657

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "cmath"

using namespace std;

const long long int MOD = 1000000007;

long long int N, M, K, H, W, L, R;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	string s;
	cin >> s;
	N = s.size();
	if (N == 1) {
		cout << 1 << endl;
		return 0;
	}
	s.push_back('"');
	vector<int>v;
	char bef = '8';
	int box = 0;
	for (auto i : s) {
		if (bef == i) {
			box++;
		}
		else {
			v.push_back(box);
			bef = i;
			box = 1;
		}
	}
	v.push_back(0);
	int ans = 0;
	for (int i = 1; i < v.size() - 1; i++) {
		ans = max(v[i] + min(v[i - 1], v[i + 1]), ans);
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result