4261. 孤独的照片贡献法乘法原理

最新推荐文章于 2024-08-30 15:57:36 发布

我也念过晚霞

最新推荐文章于 2024-08-30 15:57:36 发布

阅读量111

点赞数 1

分类专栏： AcWing 文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/2303_79132118/article/details/136589940

版权

AcWing 专栏收录该内容

247 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

typedef long long LL;

const int N = 500010;

int n;
char str[N];
int l[N], r[N];

int main()
{
    scanf("%d%s", &n, str);
    for (int i = 0, sh = 0, sg = 0; i < n; i ++ )
        if (str[i] == 'G') l[i] = sh, sg ++, sh = 0;
        else l[i] = sg, sh ++, sg = 0;

    for (int i = n - 1, sh = 0, sg = 0; i >= 0; i -- )
        if (str[i] == 'G') r[i] = sh, sg ++, sh = 0;
        else r[i] = sg, sh ++, sg = 0;

    LL res = 0;
    for (int i = 0; i < n; i ++ )
        res += (LL)l[i] * r[i] + max(r[i] - 1, 0) + max(l[i] - 1, 0);

    printf("%lld\n", res);
    return 0;
}