We have a string of letters 'a' and 'b'. We want to perform some operations on it. On each step we choose one of substrings "ab" in the string and replace it with the string "bba". If we have no "ab" as a substring, our job is done. Print the minimum number of steps we should perform to make our job done modulo 109 + 7.
The string "ab" appears as a substring if there is a letter 'b' right after the letter 'a' somewhere in the string.
The first line contains the initial string consisting of letters 'a' and 'b' only with length from 1 to 106.
Print the minimum number of steps modulo 109 + 7.
ab
1
aab
3
The first example: "ab" → "bba".
The second example: "aab" → "abba" → "bbaba" → "bbbbaa".
ab->bba,我们可以看到特点就是a的数量不变,并且a都被变到最后一位
从后往前扫,对于每一个a,需要的变换次数是其后的b的个数,而每一次变换,b的个数加一。模拟一下即可
#include<cstdio>
#include<cstring>
#include<queue>
#include <cstdlib>
#include<map>
#include <set>
#include <queue>
#include <iostream>
#include <string>
using namespace std;
const int MAXN = 1000010;
long long INF = 0x7fffffffffffffff;
const long long MODE = 1e9 + 7;
int main() {
string a;
cin >> a;
int n = a.length();
long long ans = 0;
long long res = 0;
for (int i = n - 1; i >= 0; i--) {
if (a[i] == 'a') {
res = (res + ans) % MODE;
ans = (ans*2)%MODE;
}
else {
ans=(ans+1)%MODE;
}
}
cout << res << endl;
//system("pause");
}