ABC162 D RGB Triplets

D - RGB Triplets

题意：有一个长度为 n 的字符串 s，只包含字符 R G B，找出满足以下两个条件的三元组 (i,j,k)(1≤i<j<k≤n)

要得到三个字母不同的子序列，直接考虑用乘法原理。之后再进行遍历把满足 j−i=k−j 的情况去掉即可。

#include <iostream>
#include <algorithm>
#include <iomanip>
#include"stdio.h"
#include <cstring>
#include<math.h>
#include<map>
#include<queue>
#include<stack>
#include"time.h"
#define MAX_INT  ((unsigned)(-1)>>1)
#define MIN_INT  (~MAX_INT)
#define db printf("where!\n");
#define pb push_back
using namespace std;
#define ll long long
ll gcd(ll x,ll y){return y ? gcd(y,x%y) : x;}
template<class T>inline void read(T &res){
char c;T flag=1;
while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}
ll n, r, g, b;
ll ans;
string s;
int main()
{
    read(n);
    cin>>s;
    s=" "+s;
    for(int i=1;i<=n;i++){
        if (s[i] == 'R') r++;
        if (s[i] == 'G') g++;
        if (s[i] == 'B') b++;
    }
    ans = r * g * b;
    int k = (n - 3)/2;  //计算(n-3)/2
    for (int i = 0; i <= k; i++){  //枚举两个字符之间的差
        for (int j = 1; j + 2 * i + 2 <= n; j++){  //枚举j的大小
            if (s[j] != s[j+i+1] && s[j] != s[j+i*2+2] && s[j+i+1] != s[j+i*2+2]){  //如果满足条件1，就讲ans--
                ans--;
            }
        }
    }
    cout << ans << endl;
    return 0;
}