提出 #50423466

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000007;
int A[N];
int read(){
	char ch;
	cin>>ch;
	return (ch=='A'?1:-1);
}
int cls(int x){
	if (x>0){
		return 1;
	}
	if (x<0){
		return -1;
	}
	return 0;
}
void solve(){
	int n;
	cin>>n;
	int st = read();
	for(int i = 1;i<n;i+=1){
		A[i] = read();
	}
	int sum = 0;
	int ans = 0;
	for(int i = 1;i<n;i+=1){
		int nsum = sum+A[i];
		if (cls(nsum)!=cls(sum+st)){
			ans += 1;
		}
		sum = nsum;
	}
	cout<<ans+1<<'\n';
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	int tt = 1;
	while(tt--){
		solve();
	}
}

提出情報

ジャッジ結果