Codeforces Round #226 (Div. 2)
- WBOYオリジナル
- 2016-06-07 15:44:081226ブラウズ
The bear has a string s ?=? s 1 s 2 ... s | s | (record | s | is the string's length), consisting of lowercase English letters. The bear wants to count the number of such pairs of indices i ,? j (1?≤? i ?≤? j ?≤?| s |) , that string x (
The bear has a string s?=?s1s2... s|s| (record |s| is the string's length), consisting of lowercase English letters. The bear wants to count the number of such pairs of indices i,?j (1?≤?i?≤?j?≤?|s|), that string x(i,?j)?=?sisi?+?1... sj contains at least one string "bear" as a substring.
String x(i,?j) contains string "bear", if there is such index k (i?≤?k?≤?j?-?3), that sk?=?b, sk?+?1?=?e, sk?+?2?=?a, sk?+?3?=?r.
Help the bear cope with the given problem.
声明：
この記事の内容はネチズンが自主的に寄稿したものであり、著作権は原著者に帰属します。このサイトは、それに相当する法的責任を負いません。盗作または侵害の疑いのあるコンテンツを見つけた場合は、admin@php.cn までご連絡ください。