This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define all(x) x.begin(), x.end()
int main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n;
	string s;
	cin >> n >> s;
	vector <int> W, B;
	for (int i = 0; i < n; ++i) {
		if (s[i] == s[i + n]) {
			(s[i] == 'W' ? W : B).pb(i);
		}
	}
	ll ans = 1ll * n * (n - 1) / 2, mn = 1ll << 60;
	int m = W.size();
	if (!m) {
		cout << ans << '\n';
		return 0;
	}
	for (int rt = 0; rt < m; ++rt) {
		ll sum = 0;
		for (int i = 0; i < m; ++i) {
			int len = abs(W[i] - B[(i + rt) % m]);
			sum += min(len, 2 * n - len);
		}
		mn = min(mn, sum);
	}
	cout << ans - mn << '\n';
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |