codeforces Minimum number of steps 思维
来源:互联网 发布:淘宝卖水果只做本地 编辑:程序博客网 时间:2024/05/21 15:51
D. Minimum number of steps
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
Input
The first line contains the initial string consisting of letters ‘a’ and ‘b’ only with length from 1 to 106.
Output
Print the minimum number of steps modulo 109 + 7.
Examples
input
ab
output
1
input
aab
output
3
Note
The first example: “ab” → “bba”.
The second example: “aab” → “abba” → “bbaba” → “bbbbaa”.
简单的思维题 保存每个位后面的 b的数量即可。看规律可知,每次遇到一个 a 后面的b的数量会加倍
#include <bits/stdc++.h>using namespace std;long long wei[2010100];const int mod=1e9+7;int main(){ string s; cin>>s; int len=s.length(); long long sum=0; long long sum1=0; for(int i=len-1;i>=0;i--) { if(s[i]=='b') { sum++; sum%=mod; } else if(s[i]=='a') { wei[i]=sum; sum+=wei[i]; sum%=mod; wei[i]%=mod; } } long long res=0; for(int i=0;i<len;i++) { res+=wei[i]; res%=mod; } printf("%lld\n",res );}
- codeforces Minimum number of steps 思维
- 【CodeForces 804B】Minimum number of steps(思维+数学)
- Codeforces 805D Minimum number of steps
- CodeForces 805D Minimum number of steps
- codeforces 804B Minimum number of steps
- 【Codeforces 805】D. Minimum number of steps
- codeforces Minimum number of steps (804 B)
- Codeforces Round #411(Div. 2)D. Minimum number of steps【思维递推+快速幂】
- Codeforces Round #411 D. Minimum number of steps (思维题)
- Codeforces Round #411 (Div. 2) D. Minimum number of steps(思维题目)
- Codeforces Round #411 D. Minimum number of steps【逆向思维+模拟】
- Minimum number of steps
- Minimum number of steps
- CF#804 B. Minimum number of steps(字符串,思维)
- Codeforces Round #411 D. Minimum number of steps
- Codeforces Round #411 (Div. 2) D. Minimum number of steps
- Codeforces-804 B. Minimum number of steps(贪心+规律)
- Codeforces Round #411 (Div. 2) D. Minimum number of steps
- 课堂笔记_ 材质反射属性模型BRDF_01
- git的使用(一)
- Flatten Binary Tree to Linked List
- Linux命令缩写
- 仿腾讯云单选控件
- codeforces Minimum number of steps 思维
- HDU 2639 Bone Collector II (01背包 第K优解)
- redis 两种持久化方式
- 基本的算法设计技术
- Python函数默认参数值
- css相对定位
- 读取文件中的所有图片的路径,保存到txt文件中。
- C/C++学习(6)辨析#include<> 和 #include" "
- 数模的matlab自学准备阶段