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.
The first line contains a non-empty string s (1 ≤ |s| ≤ 5000). It is guaranteed that the string only consists of lowercase English letters.
Print a single number — the answer to the problem.
bearbtear
6
bearaabearc
20
In the first sample, the following pairs (i, j) match: (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (1, 9).
In the second sample, the following pairs (i, j) match: (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (1, 9), (1, 10), (1, 11), (2, 10), (2, 11), (3, 10), (3, 11), (4, 10), (4, 11), (5, 10), (5, 11), (6, 10), (6, 11), (7, 10), (7, 11).
题意:
给出一个字符串str,统计有多少个子串里面有包含 bear 这个子子串的。
思路:
一开始想得太复杂了,用了一种很暴力的方法解决,毫无疑问会TLE,但是其实一点都不复杂。
首先先统计每个 bear 的序列起点和终点位置,所求总和就是((每个bear的起点 )到(上一个bear的起点 + 1)的个数) * ((该bear 的终点)到(串末尾)的个数)即为所求。
其中第一个 bear 就是((串头)到(第一个bear的起点)的个数)*((该bear 的终点)到(串末尾)的个数)。
AC:
#include<stdio.h>
#include<string.h>
typedef struct
{
int sta,end;
}node;
node no[5005];
int num(int s,int e)
{
return (e - s + 1);
}
int main()
{
char str[5005];
int len,sum = 0,ans = 0;
scanf("%s",&str);
len = strlen(str);
for(int i = 0;i < len - 3;i++)
{
if(str[i] == 'b' && str[i + 1] == 'e' && str[i + 2] == 'a' && str[i + 3] == 'r')
{
sum++;
no[sum].sta = i;
no[sum].end = i + 3;
}
}
int in = 0;
for(int i = 1;i <= sum;i++)
{
ans += num(in,no[i].sta) * num(no[i].end,len - 1);
in = no[i].sta + 1;
}
printf("%d\n",ans);
return 0;
}