欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识!
您现在的位置是: 首页  >  数据库

Codeforces Round #226 (Div. 2)

程序员文章站 2023-12-25 17:28:15
...

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.

上一篇:

下一篇: