题目:
![](https://i-blog.csdnimg.cn/blog_migrate/e52d73c675736c2be54d14ee62621402.png)
思路:
求每个字符的贡献值
![](https://i-blog.csdnimg.cn/blog_migrate/07e4b68eb3272f07b246e56ab7bf4a9b.png)
![](https://i-blog.csdnimg.cn/blog_migrate/9dbe8aee9afc8eb659db81c776aca751.png)
代码
#include <iostream>
#include <algorithm>
using namespace std;
string str;
int num;
int main()
{
cin >> str;
int len = str.length();
for (int i = 0; i <= len - 1; i++) {
int a1 = 1, a2 = 1;
for (int j = i; j >= 0; j--) {
if (str[j] == str[i] && j != i)
break;
else if (str[j] != str[i])
a1++;
}
for (int k = i; k <= len - 1; k++) {
if (str[k] == str[i] && k != i)
break;
else if (str[k] != str[i])
a2++;
}
num += a1 * a2;
}
cout << num;
return 0;
}