L - Segment Occurrences

最新推荐文章于 2024-10-16 10:13:45 发布

wky的代码小仓库

最新推荐文章于 2024-10-16 10:13:45 发布

阅读量111

点赞数

分类专栏：蓝桥杯训练—枚举文章标签： c++

本文链接：https://blog.csdn.net/weixin_55248863/article/details/122834373

版权

给定两个字符串ss和tt，求在ss的子串中tt出现的次数。每行包含查询的开始和结束索引，输出每个查询的tt出现次数。

摘要由CSDN通过智能技术生成

L - Segment Occurrences

You are given two strings ss and tt, both consisting only of lowercase Latin letters.

The substring s[l..r]s[l..r] is the string which is obtained by taking characters s_l, s_{l + 1}, \dots, s_rsl,sl+1,…,sr without changing the order.

Each of the occurrences of string aa in a string bb is a position ii (1 \le i \le |b| - |a| + 11≤i≤∣b∣−∣a∣+1) such that b[i..i + |a| - 1] = ab[i..i+∣a∣−1]=a (|a|∣a∣ is the length of string aa).

You are asked qq queries: for the ii-th query you are required to calculate the number of occurrences of string tt in a substring s[l_i..r_i]s[li..ri].

Input

The first line contains three integer numbers nn, mm and qq (1 \le n, m \le 10^31≤n,m≤103, 1 \le q \le 10^51≤q≤105) — the length of string ss, the length of string tt and the number of queries, respectively.

The second line is a string ss (|s| = n∣s∣&