提出 #56264675

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

char win(char c) {
	if(c == 'R') return 'P';
	if(c == 'S') return 'R';
	if(c == 'P') return 'S';
	return c;
}
char draw(char c) {
	return c;
}

void solve() {
	int n; string s; cin >> n >> s;
	vector<vector<int>> dp(n + 1, vector<int>(2, -1));
	dp[1][0] = 0, dp[1][1] = 1;
	s = "%" + s;
	for(int i = 2; i <= n; ++i) {
		//win current:
		if(win(s[i]) != draw(s[i - 1])) dp[i][1] = max(dp[i][1], dp[i - 1][0] + 1);
		if(win(s[i]) != win(s[i - 1])) dp[i][1] = max(dp[i][1], dp[i - 1][1] + 1);
		//draw current
		if(draw(s[i]) != draw(s[i - 1])) dp[i][0] = max(dp[i][0], dp[i - 1][0]);
		if(draw(s[i]) != win(s[i - 1])) dp[i][0] = max(dp[i][0], dp[i - 1][1]);
	}
	cout << max(dp[n][0], dp[n][1]);
}

int32_t main() {
	ios_base::sync_with_stdio(0);cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) {
		solve();
	}
}

提出情報

ジャッジ結果