Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define ll long long
- #define ld long double
- #define pi pair<ll, ll>
- #define F first
- #define S second
- #define pb push_back
- #define PI acos(-1.0)
- using namespace std;
- ll n, pre[1010][4], tmp;
- string s;
- int main()
- {
- ios::sync_with_stdio(0);
- cin.tie(0); cout.tie(0);
- // freopen("robots.in", "r", stdin);
- ll T; cin >> T;
- while(T--){
- memset(pre, 0, sizeof pre);
- int Ans = 0;
- cin >> n;
- cin >> s;
- for (int i=1; i<=n; i++){
- if (s[i-1] == 'P') pre[i][2] = 1;
- if (s[i-1] == 'R') pre[i][1] = 1;
- if (s[i-1] == 'S') pre[i][0] = 1;
- }
- for (int i=1; i<=n; i++)
- for (int j=0; j<3; j++)
- pre[i][j] += pre[i-1][j];
- for (int i=0; i<=n; i++)
- for (int j = 0; j+i <= n; j++){
- tmp = pre[i][0] + pre[j+i][1] - pre[i][1] + pre[n][2] - pre[j+i][2];
- if (tmp > n - tmp) Ans++;
- }
- cout << Ans << '\n';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement