Home > Database > Mysql Tutorial > Codeforces Round #226 (Div. 2)

Codeforces Round #226 (Div. 2)

WBOY
Release: 2016-06-07 15:44:08
Original
1259 people have browsed it

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?=?bsk?+?1?=?esk?+?2?=?ask?+?3?=?r.

Help the bear cope with the given problem.

Related labels:
source:php.cn
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Popular Tutorials
More>
Latest Downloads
More>
Web Effects
Website Source Code
Website Materials
Front End Template